Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Euler and Lamé are said to have proven FLT for $n=3$ that is, they are believed to have shown that $x^3 + y^3 = z^3$ has no nonzero integer solutions. According to Kleiner they approached this by decomposing $x^3 + y^3$ into $(x + y)(x + y\omega)(x + y\omega^2)$ where $\omega$ is the primitive cube root of unity or $w = \frac{-1 + \sqrt{3}i}{2}$.

How would you finish the rest of the proof?

share|improve this question
    
By Kleiner, do you mean Israel Kleiner, "From Fermat to Wiles: Fermat's Last Theorem becomes a theorem," Elemente der Mathematik, 55 (1), February 2000, pp. 19–37 , available at math.stanford.edu/~lekheng/flt ? –  lhf May 4 '12 at 13:30
    
According to Wikipedia, Euler used infinite descent, not $\mathbb Z[\omega]$. –  lhf May 4 '12 at 13:33

3 Answers 3

The proof takes 5 pages in Hardy and Wright, An Introduction to the Theory of Numbers (pages 248 to 253 in the 6th edition). No doubt it can be found in many other intro Number Theory texts, as well as on the web.

share|improve this answer

Ribenboim's Fermat's Last Theorem for Amateurs is an excellent resource for this.

You can also check out this blog, but I always found it hard to navigate.

share|improve this answer

I recommend Harold Edwards' Fermat's Last Theorem. Euler's method of infinite descent for the case n = 3 (with a careful explanation of the gap in Euler's proof) is given and corrected in sections 2.2, 2.5 of this book. This also takes about 5 pages.

This may be the version in Hardy and Wright but I doubt it. Edwards also explains that the idea can be corrected using an idea of Euler's, so the whole thing is essentially due to Euler.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.