Consider the following proof.
0 = ( 1 − 1 ) + ( 1 − 1 ) + ( 1 − 1 ) + … + ( 1 − 1 ) → 1 ⟹ 0 = 1 + ( − 1 + 1 ) + ( − 1 + 1 ) + … + ( − 1 + 1 ) → 2 ⟹ 0 = 1 + 0 + 0 + … + 0 → 3 ⟹ 0 = 1 → 4
The above is a Mathematical fallacy .
If you know that the proof is wrong, find which step is being wrong .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice question! Its is obviously obvious tgat should obviously choose option 2 :P
If I may, what is a Pare?
Log in to reply
Sorry typo. I was to mean paired
Log in to reply
Ah, I see. It was being repeated quite often, so I thought it was some other-world terminology. Cheers!
Problem Loading...
Note Loading...
Set Loading...
The answer is step 2, let’s see why. STEP 1 : 0 = ( 1 − 1 ) + ( 1 − 1 ) + … + ( 1 − 1 ) STEP 2 : 0 = 1 + ( − 1 + 1 ) + ( − 1 + 1 ) + . . . + ( − 1 + 1 ) If you look at the above step, first "1" is being taken out, and "-1", "1" are being pared. So the last 3 pares will be 0 = 1 + . . . + ( − 1 + 1 ) + ( − 1 + 1 ) − 1 Here, "-1" is being left, as first "-1" and next "1" are being pared, last "-1" have no pare to be subtracted with, So the wrong step is 2