Prove that for n greater than 2, the equation a^n+b^n=c^n has no non-trivial solution in the integers?

Question

a raise to n + b raise to n=c raise to n

Answer 1

This is the Fermat's last theorem

In the case n = 2, it is the Diophantine equation a2 + b2 = c2 (linked with the Pythagorean theorem) has integer solutions, such as (3,4,5) (32 + 42 = 52) or (5,12,13). These solutions are known as Pythagorean triples, and there exist infinitely many of them.(that is, when the entire equation is multiplied by the same number).
For the entire proof click:

Answer 2

Wow. That solution took a couple of centuries to solve, and it wasn't easy. Are you really expecting an answer here? Yahoo doesn't allow enough space for an answer.

Answer 3

Look up the proof to Fermat's last theorem.

Answer 4

1) You have stated Fermat's Last theorem.
http://en.wikipedia.org/wiki/Fermat's_last_theorem