A proof with a mistake ( or not )

Algebra Level 2

Fermat's Last Theorem is a theorem that was proved only after 358 years. The theorem states that for all n 3 n \geq 3 , the equation a n + b n = c n a^{n} + b^{n} = c^{n} has no positive integer solutions.Below is a proof for the special case n = 3 n = 3 .Given that c a < b c - a < b (which is easy to prove),find the mistake.

Step 1 - a 3 + b 3 < a 3 + ( c a ) 3 a^{3} + b^{3} < a^{3} + (c-a)^{3} because c a < b c - a < b .

Step 2 - a 3 + b 3 < c 3 3 a c 2 + 3 a 2 c a^{3} + b^{3} < c^{3} - 3ac^{2} + 3a^{2}c after calculating the value of ( c a ) 3 (c-a)^{3} and removing the a 3 a^{3} terms.

Step 3 - c 3 < c 3 3 a c ( c a ) c^{3} < c^{3} - 3ac(c-a) by replacing a 3 + b 3 a^{3} + b^{3} with c 3 c^{3} and factoring.But this implies that c 3 c^{3} is smaller than something smaller than itself,so a 3 + b 3 c 3 a^{3} + b^{3} \neq c^{3} .

None of them,this is a valid proof Step 1 Step 3 Step 2

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.

1 solution

Tan Li Xuan
May 6, 2014

Step 1 is wrong because c a < b c - a < b so it should be a 3 + b 3 > a 3 + ( c a ) 3 a^{3} + b^{3} > a^{3} + (c-a)^{3} instead of a 3 + b 3 < a 3 + ( c a ) 3 a^{3} + b^{3} < a^{3} + (c-a)^{3} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...