Abel Prize For Proving Fermat's Last Theorem |

Written by Mike James |

Monday, 21 March 2016 |

In 1994 Andrew Wiles proved Fermat’s Last Theorem, which at the time was the most famous, and long-running, unsolved problem in the history of mathematics. Over 20 years later this achievement has earned him the Abel Prize, widely considered as the Nobel Prize for mathematics. The Norwegian Academy of Science and Letters established the Abel Prize, which is worth 6 million Norwegian kroner (approximately US$720,000, or EUR 640,000 ) in 2002 to recognize contributions of extraordinary depth and influence to the mathematical sciences. This year it has been awarded to Sir Andrew J Wiles:
The Abel Committee is made up of five research scientists in the field of mathematics, both Norwegian and non-Norwegian. Its members of the Abel Committee are appointed for a period of two years and may be reappointed once. Commenting on the decision for this year's award the Abel committee stated:
As the Abel Prize press release points out Andrew Wiles, who is currently Royal Society Research Professor at the University of Oxford, of is one of very few mathematicians – if not the only one – whose proof of a theorem has made international headline news.
Wiles is, of course, not the first to get a passion for the theorem. There have been lots of naive and even wrong potential proofs of Fermat's last theorem. One of the reasons is that it is so accessible:
If n=2 then you have Pythagoras' theorem and there are lots of solutions - an infinite number of Pythagorean triples like 3,4,5. However, no similar examples were known for n>2. Fermat also encouraged people to think that a proof was easy by writing the margin of a book in 1637:
The chances are that the great Fermat was wrong about having a proof, even if it was too big for a margin. Wiles's proof consists of two papers that fill an entire issue of the Annals of Mathematics. This is not to say that no progress was made in the 300 years before the completion of Wiles's proof - Fermat did prove it for n=4, Euler managed it for n=3 and Sophie Germain pointed the way to the proof for n in an infinite class of primes. Even before the final proof it looked fairly certain that the conjecture was true. Notice, however, that you can only use a computer to disprove the conjecture by finding a counter example for n>2. The final proof relied on elliptic curve theory, which is also important in elliptic curve cryptography. The connection is that:
Wiles' proof shows that elliptic curves of the above form always have a modular form and hence we have proof by contradiction that no such solution exists.
## More Information## Related ArticlesComplexity Theorist Gets Abel Prize
To be informed about new articles on I Programmer, sign up for our weekly newsletter, subscribe to the RSS feed and follow us on, Twitter, Facebook, Google+ or Linkedin.
## Comments
or email your comment to: comments@i-programmer.info |

Last Updated ( Sunday, 16 September 2018 ) |