Go back
2+2=5

2+2=5

Posers and Puzzles

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
Ok
I was talking about the ORIGINAL question ...

I thought you were questioning my dimissal of Tournymanagers 'proof' which is of course invalid as a proof although obviously true.
But you quoted my latest posting...?

Anyway, the prof of mine, of ours, I've tried that on a 15 year old and he understood it perfectly. The only thing that he had to grasp was the meaning of the trippledot as a sign of repetition.

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
You have started with the assumption that 1/3 = 0.3333... which was not given.

(Prove that 0.333 .... = 1/3 !)
10 * 1/3 = 10/3 = 3 + 1/3,

so 1/3 = 3/10 + 1/30.

Assuming I don't have to prove that 3/10 = 0,3;

thus 1/3 = 0,3 + (1/3)/10.

Leaving us with 1/3 = 0,333...

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
You have started with the assumption that 1/3 = 0.3333... which was not given.

(Prove that 0.333 .... = 1/3 !)
why would i have to prove it? if you take 1 and divide it by 3 you get 0.333333......repeated.

Clock
Vote Up
Vote Down

Originally posted by tournymangr
why would i have to prove it? if you take 1 and divide it by 3 you get 0.333333......repeated.
How do you know its repeated forever?

The whole point of mathematical proof is its VIGOUR!

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
How do you know its repeated forever?

The whole point of mathematical proof is its VIGOUR!
Because each step in the process is exactly the same. Write in another zero, drop it down, realize that 3 goes into 10 3 times with 1 left over, repeat over and over and over...

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
How do you know its repeated forever?!
Using the euclidian division algoritm, as you do when you divide manually without any calculator, it is easily seen that the proof is unneccesary. Prform the algoritm and you'll see by yourself.

Clock
Vote Up
Vote Down

OK. Prove the algorithm!

My point was you cannot assume another anything until proven.

Clock
Vote Up
Vote Down

Originally posted by wolfgang59
OK. Prove the algorithm!

My point was you cannot assume another anything until proven.
Done so since the ancient times of the greeks.

If you don't know the euclidian division algoritm, or never performed it yourself, I can understand that you have to ask the question. Else it is obvious when you do.
It's all about repetition. 10/3 gives 3 reminder 1, again again again, with no end. Therfore 1/3 gives only 3's as decimals with no end.
1/3 = 0.33333333....

Clock
Vote Up
Vote Down

Originally posted by smw6869
Anyone know how to prove this to be true(even though it's not). A math teacher proved it to my math class. Everything made sense and no one could find the falacy.
how about this to prove 1=0
0= 0 + 0 + 0 + . . .
0= (1 - 1) + (1 - 1) + (1 - 1) + . . .
0= 1 - 1 + 1 - 1 + 1 - 1 + . . .
0= 1 + (-1 + 1) + (-1 + 1) + (-1 + 1) + . . .
0= 1 + 0 + 0 + 0 + . . .= 1

Clock
Vote Up
Vote Down

Originally posted by FabianFnas
Done so since the ancient times of the greeks.

If you don't know the euclidian division algoritm, or never performed it yourself, I can understand that you have to ask the question. Else it is obvious when you do.
It's all about repetition. 10/3 gives 3 reminder 1, again again again, with no end. Therfore 1/3 gives only 3's as decimals with no end.
1/3 = 0.33333333....
Dear Fabian, I have never experienced the euclidial division algorithm position. How many repititions? Over and over again? For how long? Gracious sakes, i must change my diapers. Later, king of the 50's rock and roll era.

Granny.

Clock
Vote Up
Vote Down

Originally posted by Arachnarchist
how about this to prove 1=0
0= 0 + 0 + 0 + . . .
0= (1 - 1) + (1 - 1) + (1 - 1) + . . .
0= 1 - 1 + 1 - 1 + 1 - 1 + . . .
0= 1 + (-1 + 1) + (-1 + 1) + (-1 + 1) + . . .
0= 1 + 0 + 0 + 0 + . . .= 1
You snuck in an extra +1 in the fourth step without including it's partner -1. This is incorrect.

Clock
Vote Up
Vote Down

Originally posted by Arachnarchist
how about this to prove 1=0
0= 0 + 0 + 0 + . . .
0= (1 - 1) + (1 - 1) + (1 - 1) + . . .
0= 1 - 1 + 1 - 1 + 1 - 1 + . . .
0= 1 + (-1 + 1) + (-1 + 1) + (-1 + 1) + . . .
0= 1 + 0 + 0 + 0 + . . .= 1
Wha??????????

G.

Clock
Vote Up
Vote Down

Originally posted by smw6869
Dear Fabian, I have never experienced the euclidial division algorithm position. How many repititions? Over and over again? For how long? Gracious sakes, i must change my diapers. Later, king of the 50's rock and roll era.

Granny.
BYE EL VEZ

Clock
Vote Up
Vote Down

Originally posted by AThousandYoung
BYE EL VEZ
El Wha????? Don't make Granny demote you to 10^2, You little persnickity whippersnapper. Why, i'll set your brain on fire with a little binary whatchamacallit. You know what i'm talking.

G.

Clock
Vote Up
Vote Down

Originally posted by smw6869
El Wha????? Don't make Granny demote you to 10^2, You little persnickity whippersnapper. Why, i'll set your brain on fire with a little binary whatchamacallit. You know what i'm talking.

G.
😳

Cookies help us deliver our Services. By using our Services or clicking I agree, you agree to our use of cookies. Learn More.