xⁿ+yⁿ · Fermat's Last Theorem
Fermat's Last Theorem
3² + 4² = 5². Can you build such a perfect equation with cubes?
A one-line note 'the margin is too small', and a 358-year chase
Think about it first
Make a prediction first. Change one input at a time and compare what happens with what you expected.
Find whole numbers with xⁿ + yⁿ = zⁿ
Pick n, then move x and y. If z lands on a whole number, you win.
3² + 5² = 34
So close! Nearest is 6² = 36 — off by -2. z did not land on a whole number.
Hint: at n=2, try x=3, y=4. (5,12) works too.
Read the solution when you are ready
Proving that something does not exist becomes mathematics' longest journey.
Why does this question matter?
The Pythagorean equation x²+y²=z² has endless whole-number solutions: (3,4,5), (5,12,13), and on and on. So what happens if you raise the exponent to 3?
Around 1637, Fermat wrote in a book margin: no solutions exist for 3 and above, and he had found a marvelous proof the margin was too small to hold. That note opened the longest chase in the history of mathematics.
Proving 'there is one' ends with a single find. Proving 'there is none' must rule out infinitely many candidates. This asymmetry made the problem a 358-year one.
Read the idea from another angle
'There is one' takes a single find; 'there is none' takes everything.
An existence proof ends with one example, but a nonexistence proof must handle all of infinity. The gap between you finding a solution at n=2 and mathematicians spending 358 years on n=3 is exactly this.
Missing by a hair is not the same as not existing.
6³+8³=728 falls exactly 1 short of 9³. Countless near misses like this exist, yet not a single exact hit. Wiles's proof settled that 'not a single one' over all of infinity.
Now read the definitions with their conditions
Write down the success you had at n=2 and the near misses at n=3, and you get the sentence Fermat left in the margin.
The Pythagorean door (n=2)
With squares, whole-number solutions are endless: (5,12,13), (8,15,17), and more. These are the solutions you found with the sliders.
Fermat's Last Theorem
Raise the exponent to just 3 and not a single solution exists. A conjecture from around 1637 became a theorem with Wiles's 1995 proof.
The agonizing near miss
Near-integer hits abound, but they always miss. No pile of 'almost right' ever adds up to one 'right'.
Make one more distinction
Checking up to a huge number by computer counts as a proof.
However far you check, the 'next number' always remains. Covering infinity takes a structural proof, not verification. That is why it took 358 years.
No solution has appeared because we haven't found it yet.
For n ≥ 3, solutions are not 'unfound' — they cannot exist. Wiles's proof ruled out every candidate at once.
Where else can this idea help?
Why checking is not proving
Running software tests forever still cannot guarantee there are no bugs — the same structure. Where exhaustive checking is impossible, structural proof is required.
The byproduct that became the main act
Chasing this problem gave birth to entire fields like algebraic number theory, whose tools now underpin cryptography. One problem redrew the map of mathematics.
Wiles's seven years (true story)
Wiles worked in secret in his attic study for seven years and announced a proof in 1993. A flaw surfaced; he fought one more year, closed it in 1994, and published in 1995 — the dream of a boy who met this problem at age ten.
The power of one counterexample
In 1769 Euler made a Fermat-like conjecture. In 1966 a single counterexample (27⁵+84⁵+110⁵+133⁵=144⁵) demolished it. One counterexample ends a mathematical statement.
Explain it in your own words
Check the idea with practice problems (4)
Questions completed 0 / 4
1. What does Fermat's Last Theorem say?
2. With n=2, x=3, y=4, what is z?
3. Why is proving 'no solution exists' harder than proving 'a solution exists'?
4. A computer checks up to 10¹⁸ and finds no solution for n=3. Is the theorem proved?
What question comes next?
Previous concept
Russell's Paradox
Mathematics with rebuilt foundations now departs on a long journey to prove a 'none'.
← Russell's Paradox labLeads to next
The Riemann Hypothesis
After the problem solved in 358 years comes the million-dollar problem no one has solved yet.
Go to the The Riemann Hypothesis lab →Related lab
Pythagorean Theorem
The n=2 door — the world where solutions pour out endlessly starts with this theorem.
Go to the Pythagorean Theorem lab →Related lab
Prime Numbers
The number-theory tools born chasing this problem meet the world of primes.
Go to the Prime Numbers lab →