HomeScience GlossaryFermat's Last Theorem: The 358-Year Proof

Fermat's Last Theorem: The 358-Year Proof

Fermat's Last Theorem states that no three positive integers can satisfy a^n + b^n = c^n for any integer n greater than 2. Conjectured in 1637, it was proven by Andrew Wiles in 1995.

Share
Science Glossary · Explore this series
March 21, 2026
Key Takeaways
  • No integers satisfy a^n + b^n = c^n when n exceeds 2.
  • Andrew Wiles proved the theorem in 1995 after seven years of secret work.
  • The proof connected elliptic curves to modular forms.

Fermat's Last Theorem states that no three positive integers a, b, and c can satisfy the equation an + bn = cn for any integer n greater than 2. First proposed by French mathematician Pierre de Fermat in 1637, it remained unproven for 358 years until British mathematician Andrew Wiles published a proof in 1995.

Why It Matters

Fermat's Last Theorem occupies a singular place in mathematics. The statement is simple enough for a teenager to understand. Yet its proof required tools from algebraic geometry, modular forms, and Galois representations that did not exist when Fermat scribbled his claim in a book's margin.

Key figure

358 years

From conjecture to proof (1637-1995)

That gap between simplicity and depth made the theorem a proving ground for new mathematics. Attempts to solve it over three centuries generated entire fields. Ernst Kummer's work on the problem in the 1840s, for example, created the theory of ideal numbers, which became the foundation of modern algebraic number theory.

When Wiles finally completed the proof, the techniques he developed connected two seemingly unrelated branches of mathematics: elliptic curves and modular forms. That connection, known as the modularity theorem, opened paths to problems that had resisted attack for decades. It now underpins key parts of the Langlands Program, one of the most ambitious efforts in contemporary mathematics.

How It Works

The theorem is easy to state because of its relationship to a familiar equation. The Pythagorean theorem tells us that a2 + b2 = c2 has infinitely many whole-number solutions (3, 4, 5 and 5, 12, 13, for example). Fermat's claim is that replacing the exponent 2 with any larger integer eliminates all solutions.

Key figure

n > 2

The exponent barrier with zero solutions

Fermat himself proved the case for n = 4. Leonhard Euler handled n = 3 in the 18th century. By 1993, computers had verified the theorem for all prime exponents below four million. But individual cases could never constitute a general proof.

Wiles's approach bypassed brute force entirely. He built on a 1985 insight by German mathematician Gerhard Frey, who observed that any counterexample to Fermat's theorem would produce an elliptic curve with impossible properties.

Wiles proved that all semistable elliptic curves are modular, eliminating the possibility of any such counterexample. The proof fills two papers in the May 1995 issue of the Annals of Mathematics (one co-authored with Richard Taylor), totaling 129 pages.

Key Context

Fermat wrote his claim in the margin of his copy of Diophantus's Arithmetica around 1637. He added that he had "a truly marvelous demonstration of this proposition which this margin is too narrow to contain." No such proof was ever found in his papers.

Most mathematicians today believe Fermat did not possess a valid proof. The tools required for Wiles's solution were invented centuries after Fermat's death in 1665.

Andrew Wiles first encountered the theorem at age ten, reading Eric Temple Bell's The Last Problem in a Cambridge library. He worked on the proof in secret for seven years before announcing it at the Isaac Newton Institute on June 23, 1993.

A gap discovered during peer review took another year to fix, with help from Richard Taylor. For his work, Wiles received a special silver plaque from the International Mathematical Union in 1998 (the Fields Medal has an age limit of 40, which Wiles had passed). He was knighted in 2000 and awarded the Abel Prize in 2016.

FAQ

Did Fermat actually have a proof?

Almost certainly not. The tools needed for Wiles's 1995 proof, including the theory of elliptic curves and modular forms, were developed centuries after Fermat's death in 1665. Most number theorists believe Fermat either made an error or had a proof that worked only for specific cases.

Why did it take so long to prove?

The proof required connecting two distant areas of mathematics (elliptic curves and modular forms) through the Taniyama-Shimura conjecture. These fields did not exist in Fermat's time and took centuries to develop. Even with the necessary mathematics in place, Wiles spent seven years of solitary work to finish the argument.

What did the proof change about mathematics?

Wiles's proof established the modularity theorem for semistable elliptic curves, later extended to all elliptic curves by 2001. This result became a cornerstone of the Langlands Program, an ongoing effort to unify number theory and harmonic analysis. It also contributed to advances in modern encryption methods.

Related Reading

collatz conjecture
Collatz Conjecture: Why 3n+1 Has Defied Proof Since 1937
mathematics
Mathematics: The Language That Describes Reality
Langlands Program
Langlands Program: Mathematics' Bridge Between Worlds

Sources

Fact Check: Claim-by-Claim Verification Verified

All 16 factual claims verified against authoritative sources including Encyclopaedia Britannica, Wolfram MathWorld, NSF, University of Oxford, and University of Cambridge. All dates, page counts, and attributions confirmed accurate.

1 Supported
No integers satisfy a^n + b^n = c^n for n > 2
Standard definition confirmed by Britannica and MathWorld.
2 Supported
Fermat proposed the theorem in 1637
Confirmed by multiple sources.
3 Supported
Wiles published proof in 1995
4 Supported
Proof spans 129 pages across two papers
Wiles paper pp. 443-551 (109 pages) + Taylor-Wiles paper pp. 553-572 (20 pages).
5 Supported
Ernst Kummer created theory of ideal numbers in 1840s
Confirmed by MacTutor History of Mathematics.
6 Supported
Fermat proved case n = 4; Euler proved n = 3
Standard mathematical history.
7 Supported
Computers verified all primes below 4 million by 1993
Confirmed by Britannica.
8 Supported Claim: Wiles encountered theorem at age 10 via Bell's book
Gerhard Frey's 1985 insight linked counterexamples to elliptic curves
Verdict: Supported
Confirmed by Oxford and wild.maths.org.
9 Supported Claim: IMU silver plaque 1998, knighthood 2000, Abel Prize 2016
Announced at Isaac Newton Institute on June 23, 1993
Verdict: Supported
Confirmed by Britannica biography and Oxford.

Sources used for verification

Share
Related Articles
AI In Science Connects the Dots, But Only In Fields That Are Fragmented

An analysis of 80 million papers shows AI boosts originality where knowledge is scattered and connections are weak, but contributes little novelty in structured science.

"Keep Humanity Safe From AI," Urges Pope Leo XIV

Pope Leo XIV's first encyclical reaches the same verdict on AI as the labs building it, then parts ways over the meaning of human limits.

AI Solves Erdős Math Problem: What's Next for AI in Mathematics?

An AI solved an 80-year-old Erdős math problem by walking a path mathematicians had collectively avoided.

Is AI Making You Dumber? Not If You Challenge It

Cognitive debt is the cost of letting AI think for you. New research shows the difference between healthy and harmful AI use comes down to one habit.