Proof of Fermat's Last Theorem for n = 4
Builds on Fermat's right triangle theorem
Proof
We reduce to the equation .
- Suppose , and are positive integers with .
- Then .
- So , and are positive integers with .
- This contradicts Fermat's right triangle theorem, which says that has no solution in positive integers.
- Hence there are no positive integers , and with .
Idea
A fourth power is a square. So a solution of is a solution of the stronger equation with . Fermat's descent rules that out.
Reading path
To understand this page from the ground up, read these 55 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof of the classification of Pythagorean triples, Proof of Fermat's right triangle theorem by infinite descent, Proof of Euclid's lemma, Proof of the geometric formula for the dot product, Proof of strong induction from ordinary induction, Proof that the p-adic valuation of a product is the sum of the valuations, Proof of the fundamental theorem of arithmetic, Proof of the Pythagorean theorem and its converse with the dot product, Proof of the existence of prime factorization, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the existence of a prime divisor.
- Angle at a point concept
- Angle between two vectors concept
- Definition by recursion concept
- Divisibility definition
- Dot product concept
- Euclidean distance concept
- Length of a vector concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proof by infinite descent concept
- Triangle concept
- Greatest common divisor definition
- Prime number definition
- Proof of the geometric formula for the dot product proof
- Successor function definition
- Coprime integers definition
- Pythagorean triple definition
- Prime factorization definition
- P-adic valuation definition
- Geometric formula for the dot product statement
- Addition of natural numbers definition
- The successor function is injective statement
- Zero is not a successor statement
- Vectors are perpendicular if and only if their dot product is zero statement
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- Commutativity of addition statement
- Proof of the Pythagorean theorem and its converse with the dot product proof
- Proof of strong induction from ordinary induction proof
- Strong induction statement
- Pythagorean theorem statement
- Proof of the well-ordering principle from strong induction proof
- Well-ordering principle statement
- Proof of the division algorithm proof
- Proof of the existence of a prime divisor proof
- Division algorithm statement
- Existence of a prime divisor statement
- Proof of Bézout's identity proof
- Proof of the existence of prime factorization proof
- Bézout's identity statement
- Existence of prime factorization statement
- Proof of the generalized Euclid's lemma proof
- Generalized Euclid's lemma statement
- Proof of Euclid's lemma proof
- Euclid's lemma statement
- Proof of the fundamental theorem of arithmetic proof
- Proof that the p-adic valuation of a product is the sum of the valuations proof
- Fundamental theorem of arithmetic statement
- P-adic valuation of a product statement
- Proof of the classification of Pythagorean triples proof
- Classification of Pythagorean triples statement
- Proof of Fermat's right triangle theorem by infinite descent proof
- Fermat's right triangle theorem statement
- Proof of Fermat's Last Theorem for n = 4 proof
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | EW3RMDX14G |
|---|---|
| URI | m2://EW3RMDX14G |
| Kind | proof |
| Writing | W0 stub |
| MSC | 11D25 |
| Proves | Fermat's Last Theorem for n = 4 |
| Uses | Fermat's right triangle theorem |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.