Encyclopedia > Fermat's Last Theorem

  Article Content

Fermat's last theorem

Redirected from Fermat's Last Theorem

Fermat's last theorem (also called Fermat's Great Theorem) states that:

There are no positive natural numbers a, b, and c such that
<math>a^n + b^n = c^n</math>
in which n is a natural number greater than 2.

The 17th-century mathematician Pierre de Fermat wrote about this in 1637 in his copy of Claude-Gaspar Bachet's translation of famous Diophantus' Arithmetica, "I have discovered a truly remarkable proof but this margin is too small to contain it". The reason why this statement is so significant is that all the other theorems proposed by Fermat were settled either by proofs he supplied, or by more rigorous proofs supplied afterwards. Mathematicians long were baffled by this statement, for they were unable either to prove or to disprove it. The theorem has the credit of the largest number of wrong proofs.

For various special exponents n, the theorem had been proved over the years, but the general case remained elusive. In 1983 Gerd Faltings[?] proved the Mordell conjecture, which implies that for any n > 2, there are at most finitely many coprime integers a, b and c with an + bn = cn.

Using sophisticated tools from algebraic geometry (in particular elliptic curves and modular forms[?]), Galois theory and Hecke algebras[?], the English mathematician Andrew Wiles, with help from his former student Richard Taylor[?], devised a proof of Fermat's Last Theorem that was published in 1995 in the journal Annals of Mathematics.

Frey had conjectured ("Epsilon conjecture[?]"), and Ribet had proved in 1986, that every counterexample an + bn = cn to Fermat's last theorem would yield an elliptic curve

<math>y^2 = x(x-a^n)(x + b^n)</math>

which would provide a counterexample to the Taniyama-Shimura conjecture.

This latter conjecture proposes a deep connection between elliptic curves and modular forms.

Wiles and Taylor were able to establish a special case of the Taniyama-Shimura Conjecture sufficient to exclude such counterexamples arising from Fermat's last theorem.

The story of the proof is almost as remarkable as the mystery of the theorem itself. Wiles spent 7 years in isolation working out nearly all the details. When he announced his proof in June 1993, he amazed his audience with the number of ideas and constructions used in his proof. Unfortunately, upon closer inspection a serious problem was discovered: it seemed to lead to the breakdown of this original proof. Wiles and Taylor then spent about a year trying to revive the proof. In September 1994, they were able to resurrect the proof with some different, discarded techniques that Wiles had used in his earlier attempts.

There is considerable doubt over whether Fermat's "truly remarkable proof" was correct. The methods used by Wiles were unknown when Fermat was writing, and it seems inconceivable that Fermat managed to derive all the necessary mathematics to demonstrate the same solution (in the words of Andrew Wiles, "it's impossible; this is a 20th century proof"). The alternatives are that there is a simpler proof that all other mathematicians up until this point have missed, or that Fermat was mistaken. In fact, a plausible faulty proof that might have been accessible to Fermat has been suggested. It is based on the mistaken assumption that unique factorization works in all rings of integral elements of algebraic number fields.

See also:

External links and References

Bibliography

  • Fermat's Enigma (also published under the title Fermat's Last Theorem), by Simon Singh; Bantam Books; ISBN 0802713319 (hardcover, September 1998)



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Bullying

... anyone who assumed power for any period of time without a legitimate basis of authority. The first to have the title of "Tyrant" was Pisistratus in 560 BC. I ...

 
 
 
This page was created in 92.4 ms