Fermat's Last Theorem — Definition, Formula & Examples
Fermat's Last Theorem states that there are no three positive integers , , and that satisfy the equation when is an integer greater than 2. It was conjectured by Pierre de Fermat in 1637 and finally proved by Andrew Wiles in 1995.
For any integer , the Diophantine equation has no solutions in positive integers , , . Equivalently, the only integer solutions to for are trivial ones where at least one variable equals zero.
Key Formula
Where:
- = Positive integers
- = An integer greater than 2
How It Works
When , the equation has infinitely many positive integer solutions called Pythagorean triples, such as and . Fermat's Last Theorem says that as soon as you raise the exponent above 2, solutions completely vanish. Fermat wrote in the margin of a book that he had a "truly marvelous proof" that the margin was too small to contain. Mathematicians searched for a proof for over 350 years. Andrew Wiles finally proved the theorem using deep connections between elliptic curves and modular forms, areas far beyond what Fermat could have known.
Worked Example
Problem: Verify that the Pythagorean triple (3, 4, 5) works for n = 2, then check whether it works for n = 3.
Check n = 2: Compute each side of the equation with the exponent 2.
Check n = 3: Now try the same integers with the exponent 3.
Compare: Is 91 a perfect cube? Since and , the value 91 falls between two consecutive cubes, so no integer satisfies the equation.
Answer: The triple (3, 4, 5) satisfies the equation for but not for . Fermat's Last Theorem guarantees no positive integer triple will ever work for (or any ).
Why It Matters
Fermat's Last Theorem drove centuries of progress in number theory. The techniques Wiles used to prove it—connecting elliptic curves with modular forms—opened entirely new fields of mathematical research. If you study number theory or abstract algebra in college, you will encounter the ideas that grew from this single problem.
Common Mistakes
Mistake: Thinking the theorem says a^n + b^n = c^n has no integer solutions at all for n > 2.
Correction: Trivial solutions with zero (like 0^3 + 5^3 = 5^3) do exist. The theorem specifically excludes them by requiring a, b, and c to all be positive integers.
