I know how to prove the result for n=2 by contradiction, but does anyone know a proof for general integers n ?
Thank you for your answers.
Marcus
Answer
Suppose that n√2 is rational. Then, for some p,q∈Q,
n√2=pq⟹2=pnqn⟹pn=2qn=qn+qn.
Contradiction with Fermat last theorem.
No comments:
Post a Comment