Question Corner and Discussion Area

I've seen the proof for the n=4 case of Fermat's Last TheoremThe proof that there are no integers X, Y, and Z which satisfy the equation X^n + Y^n = Z^n when n = 3 is similar to the proof in the case where n = 4 with the exception of a crucial lemma. The statement of the lemma is stated as follows:Is the the n=3 case similarly easy to prove? Was the proof known by Fermat?

If x, y, and z are integers such that x^2 + 3y^2 = z^3 and x and y are relatively prime then there exist integers a and b such that x = a^3 - 9ab^2 and y = 3a^2b - 3b^3.

The proof of this lemma hinges on some material which is typically covered
in an advanced undergraduate or an introductory graduate abstract algebra
course.
Those who are interested in more reading on the subject and who have enough
background in mathematics can find this lemma (together with hints) as
exercise 4.6 in Daniel Flath's *Introduction To Number Theory*
(see also exercises 7.6 and 7.8 for more information on cases n=3 and
n=4 of Fermat's Last Theorem).

This part of the site maintained by (No Current Maintainers)

Last updated: April 19, 1999

Original Web Site Creator / Mathematical Content Developer: Philip Spencer

Current Network Coordinator and Contact Person: Joel Chan - mathnet@math.toronto.edu

Navigation Panel:

Go backward to The n=4 Case of Fermat's Last Theorem

Go up to Question Corner Index

Go forward to A Question from the IMO

Switch to graphical version (better pictures & formulas)

Access printed version in PostScript format (requires PostScript printer)

Go to University of Toronto Mathematics Network Home Page