# Proof of Fermat's Last Theorem for specific exponents

Fermat's Last Theorem is a theorem in number theory, originally stated by Pierre de Fermat in 1637 and proven by Andrew Wiles in 1995. The statement of the theorem involves an integer exponent n larger than 2. In the centuries following the initial statement of the result and before its general proof, various proofs were devised for particular values of the exponent n. Several of these proofs are described below, including Fermat's proof in the case n = 4, which is an early example of the method of infinite descent.

## Mathematical preliminaries

Fermat's Last Theorem states that no three positive integers (a, b, c) can satisfy the equation a$^n$ + b$^n$ = c$^n$ for any integer value of n greater than 2. (For n equal to 1, the equation is a linear equation and has a solution for every possible a and b. For n equal to 2, the equation has infinitely many solutions, the Pythagorean triples.)

### Factors of exponents

A solution (a, b, c) for a given n leads to a solution for all the factors of n: if h is a factor of n then there is an integer g such that n = gh. Then (a$^g$, b$^g$, c$^g$) is a solution for the exponent h:
    (a$^g$)$^h$ + (b$^g$)$^h$ = (c$^g$)$^h$.
Therefore, to prove that Fermat's equation has no solutions for n > 2, it suffices to prove that it has no solutions for n = 4 and for all odd primes p.
For any such odd exponent p, every positive-integer solution of the equation a$^p$ + b$^p$ = c$^p$ corresponds to a general integer solution to the equation a$^p$ + b$^p$ + c$^p$ = 0. For example, if (3, 5, 8) solves the first equation, then (3, 5, −8) solves the second. Conversely, any solution of the second equation corresponds to a solution to the first. The second equation is sometimes useful because it makes the symmetry between the three variables a, b and c more apparent.

### Primitive solutions

If two of the three numbers (a, b, c) can be divided by a fourth number d, then all three numbers are divisible by d. For example, if a and c are divisible by d = 13, then b is also divisible by 13. This follows from the equation
    b$^n$ = c$^n$ − a$^n$
If the right-hand side of the equation is divisible by 13, then the left-hand side is also divisible by 13. Let g represent the greatest common divisor of a, b, and c. Then (a, b, c) may be written as a = gx, b = gy, and c = gz where the three numbers (x, y, z) are pairwise coprime. In other words, the greatest common divisor (GCD) of each pair equals one
    GCD(x, y) = GCD(x, z) = GCD(y, z) = 1
If (a, b, c) is a solution of Fermat's equation, then so is (x, y, z), since the equation
    a$^n$ + b$^n$ = c$^n$ = g$^n$x$^n$ + g$^n$y$^n$ = g$^n$z$^n$
implies the equation
    x$^n$ + y$^n$ = z$^n$.
A pairwise coprime solution (x, y, z) is called a primitive solution. Since every solution to Fermat's equation can be reduced to a primitive solution by dividing by their greatest common divisor g, Fermat's Last Theorem can be proven by demonstrating that no primitive solutions exist.

### Even and odd

Integers can be divided into even and odd, those that are evenly divisible by two and those that are not. The even integers are ...−4, −2, 0, 2, 4,... whereas the odd integers are ...−3, −1, 1, 3,.... The property of whether an integer is even (or not) is known as its parity. If two numbers are both even or both odd, they have the same parity. By contrast, if one is even and the other odd, they have different parity.
The addition, subtraction and multiplication of even and odd integers obey simple rules. The addition or subtraction of two even numbers or of two odd numbers always produces an even number, e.g., 4 + 6 = 10 and 3 + 5 = 8. Conversely, the addition or subtraction of an odd and even number is always odd, e.g., 3 + 8 = 11. The multiplication of two odd numbers is always odd, but the multiplication of an even number with any number is always even. An odd number raised to a power is always odd and an even number raised to power is always even, so for example x$^n$ has the same parity as x.
Consider any primitive solution (x, y, z) to the equation x$^n$ + y$^n$ = z$^n$. The terms in (x, y, z) cannot all be even, for then they would not be coprime; they could all be divided by two. If x$^n$ and y$^n$ are both even, z$^n$ would be even, so at least one of x$^n$ and y$^n$ are odd. The remaining addend is either even or odd; thus, the parities of the values in the sum are either (odd + even = odd) or (odd + odd = even).

### Prime factorization

The fundamental theorem of arithmetic states that any natural number can be written in only one way (uniquely) as the product of prime numbers. For example, 42 equals the product of prime numbers 2 × 3 × 7, and no other product of prime numbers equals 42, aside from trivial rearrangements such as 7 × 3 × 2. This unique factorization property is the basis on which much of number theory is built.
One consequence of this unique factorization property is that if a pth power of a number equals a product such as
    x$^p$ = uv
and if u and v are coprime (share no prime factors), then u and v are themselves the pth power of two other numbers, u = r$^p$ and v = s$^p$.
As described below, however, some number systems do not have unique factorization. This fact led to the failure of Lamé's 1847 general proof of Fermat's Last Theorem.

### Two cases

Since the time of Sophie Germain, Fermat's Last Theorem has been separated into two cases that are proven separately. The first case (case I) is to show that there are no primitive solutions (x, y, z) to the equation x$^p$ + y$^p$ = z$^p$ under the condition that p does not divide the product xyz. The second case (case II) corresponds to the condition that p does divide the product xyz. Since x, y, and z are pairwise coprime, p divides only one of the three numbers.

## n = 4

Only one mathematical proof by Fermat has survived, in which Fermat uses the technique of infinite descent to show that the area of a right triangle with integer sides can never equal the square of an integer. This result is known as Fermat's right triangle theorem. As shown below, his proof is equivalent to demonstrating that the equation
    x$^4$ − y$^4$ = z$^2$
has no primitive solutions in integers (no pairwise coprime solutions). In turn, this is sufficient to prove Fermat's Last Theorem for the case n = 4, since the equation a$^4$ + b$^4$ = c$^4$ can be written as c$^4$ − b$^4$ = (a$^2$)$^2$. Alternative proofs of the case n = 4 were developed later by Frénicle de Bessy, Euler, Kausler, Barlow, Legendre, Schopis, Terquem, Bertrand, Lebesgue, Pepin, Tafelmacher, Hilbert, Bendz, Gambioli, Kronecker, Bang, Sommer, Bottari, Rychlik, Nutzhorn, Carmichael, Hancock, Vrǎnceanu, Grant and Perella, Barbara, and Dolan. For one proof by infinite descent, see Infinite descent#Non-solvability of r$^2$ + s$^4$ = t$^4$.

### Application to right triangles

Fermat's proof demonstrates that no right triangle with integer sides can have an area that is a square. Let the right triangle have sides (u, v, w), where the area equals ⁠uv/2⁠ and, by the Pythagorean theorem, u$^2$ + v$^2$ = w$^2$. If the area were equal to the square of an integer s
    ⁠uv/2⁠ = s$^2$
then by algebraic manipulations it would also be the case that
    2uv = 4s$^2$ and −2uv = −4s$^2$.
Adding u$^2$ + v$^2$ = w$^2$ to these equations gives
    u$^2$ + 2uv + v$^2$ = w$^2$ + 4s$^2$ and u$^2$ − 2uv + v$^2$ = w$^2$ − 4s$^2$,
which can be expressed as
    (u + v)$^2$ = w$^2$ + 4s$^2$ and (u − v)$^2$ = w$^2$ − 4s$^2$.
Multiplying these equations together yields
    (u$^2$ − v$^2$)$^2$ = w$^4$ − 16s$^4$.
But as Fermat proved, there can be no integer solution to the equation x$^4$ − y$^4$ = z$^2$, of which this is a special case with z = u$^2$ − v$^2$, x = w and y = 2s.
The first step of Fermat's proof is to factor the left-hand side
    (x$^2$ + y$^2$)(x$^2$ − y$^2$) = z$^2$
Since x and y are coprime (this can be assumed because otherwise the factors could be cancelled), the greatest common divisor of x$^2$ + y$^2$ and x$^2$ − y$^2$ is either 2 (case A) or 1 (case B). The theorem is proven separately for these two cases.

### Proof for case A

In this case, both x and y are odd and z is even. Since (y$^2$, z, x$^2$) form a primitive Pythagorean triple, they can be written
    z = 2de
    y$^2$ = d$^2$ − e$^2$
    x$^2$ = d$^2$ + e$^2$
where d and e are coprime and d > e > 0. Thus,
    x$^2$y$^2$ = d$^4$ − e$^4$
which produces another solution (d, e, xy) that is smaller (0 < d < x). As before, there must be a lower bound on the size of solutions, while this argument always produces a smaller solution than any given one, and thus the original solution is impossible.

### Proof for case B

In this case, the two factors are coprime. Since their product is a square z$^2$, they must each be a square
    x$^2$ + y$^2$ = s$^2$
    x$^2$ − y$^2$ = t$^2$
The numbers s and t are both odd, since s$^2$ + t$^2$ = 2x$^2$, an even number, and since x and y cannot both be even. Therefore, the sum and difference of s and t are likewise even numbers, so we define integers u and v as
    u = ⁠s + t/2⁠
    v = ⁠s − t/2⁠
Since s and t are coprime, so are u and v; only one of them can be even. Since y$^2$ = 2uv, exactly one of them is even. For illustration, let u be even; then the numbers may be written as u = 2m$^2$ and v = k$^2$. Since (u, v, x) form a primitive Pythagorean triple
    ⁠s$^2$ + t$^2$/2⁠ = u$^2$ + v$^2$ = x$^2$
they can be expressed in terms of smaller integers d and e using Euclid's formula
    u = 2de
    v = d$^2$ − e$^2$
    x = d$^2$ + e$^2$
Since u = 2m$^2$ = 2de, and since d and e are coprime, they must be squares themselves, d = g$^2$ and e = h$^2$. This gives the equation
    v = d$^2$ − e$^2$ = g$^4$ − h$^4$ = k$^2$
The solution (g, h, k) is another solution to the original equation, but smaller (0 < g < d < x). Applying the same procedure to (g, h, k) would produce another solution, still smaller, and so on. But this is impossible, since natural numbers cannot be shrunk indefinitely. Therefore, the original solution (x, y, z) was impossible.

## n = 3

Fermat sent the letters in which he mentioned the case in which n = 3 in 1636, 1640 and 1657. Euler sent a letter to Goldbach on 4 August 1753 in which claimed to have a proof of the case in which n = 3. Euler had a complete and pure elementary proof in 1760, but the result was not published. Later, Euler's proof for n = 3 was published in 1770. Independent proofs were published by several other mathematicians, including Kausler, Legendre, Calzolari, Lamé, Tait, Günther, Gambioli, Krey, Rychlik, Stockhaus, Carmichael, van der Corput, Thue, and Duarte.
    Chronological table of the proof of n = 3 dateresult/proofpublished/not publishedworkname 1621 nonepublishedLatin version of Diophantus's ArithmeticaBachet around 1630 only resultnot publisheda marginal note in ArithmeticaFermat 1636, 1640, 1657 only resultpublishedletters of n = 3Fermat 1670 only resultpublisheda marginal note in ArithmeticaFermat's son Samuel published the Arithmetica with Fermat's note. 4 August 1753 only resultpublishedletter to GoldbachEuler 1760 proofnot publishedcomplete and pure elemental proofEuler 1770 proofpublishedincomplete but elegant proof in Elements of AlgebraEuler
As Fermat did for the case n = 4, Euler used the technique of infinite descent. The proof assumes a solution (x, y, z) to the equation x$^3$ + y$^3$ + z$^3$ = 0, where the three non-zero integers x, y, and z are pairwise coprime and not all positive. One of the three must be even, whereas the other two are odd. Without loss of generality, z may be assumed to be even.
Since x and y are both odd, they cannot be equal. If x = y, then 2x$^3$ = −z$^3$, which implies that x is even, a contradiction.
Since x and y are both odd, their sum and difference are both even numbers
    2u = x + y
    2v = x − y
where the non-zero integers u and v are coprime and have different parity (one is even, the other odd). Since x = u + v and y = u − v, it follows that
    −z$^3$ = (u + v)$^3$ + (u − v)$^3$ = 2u(u$^2$ + 3v$^2$)
Since u and v have opposite parity, u$^2$ + 3v$^2$ is always an odd number. Therefore, since z is even, u is even and v is odd. Since u and v are coprime, the greatest common divisor of 2u and u$^2$ + 3v$^2$ is either 1 (case A) or 3 (case B).

### Proof for case A

In this case, the two factors of −z$^3$ are coprime. This implies that three does not divide u and that the two factors are cubes of two smaller numbers, r and s
    2u = r$^3$
    u$^2$ + 3v$^2$ = s$^3$
Since u$^2$ + 3v$^2$ is odd, so is s. A crucial lemma shows that if s is odd and if it satisfies an equation s$^3$ = u$^2$ + 3v$^2$, then it can be written in terms of two integers e and f
    s = e$^2$ + 3f$^2$
so that
    u = e(e$^2$ − 9f$^2$)
    v = 3f(e$^2$ − f$^2$)
u and v are coprime, so e and f must be coprime, too. Since u is even and v odd, e is even and f is odd. Since
    r$^3$ = 2u = 2e(e − 3f)(e + 3f)
The factors 2e, (e – 3f), and (e + 3f) are coprime since 3 cannot divide e: if e were divisible by 3, then 3 would divide u, violating the designation of u and v as coprime. Since the three factors on the right-hand side are coprime, they must individually equal cubes of smaller integers
    −2e = k$^3$
    e − 3f = l$^3$
    e + 3f = m$^3$
which yields a smaller solution k$^3$ + l$^3$ + m$^3$ = 0. Therefore, by the argument of infinite descent, the original solution (x, y, z) was impossible.

### Proof for case B

In this case, the greatest common divisor of 2u and u$^2$ + 3v$^2$ is 3. That implies that 3 divides u, and one may express u = 3w in terms of a smaller integer, w. Since u is divisible by 4, so is w; hence, w is also even. Since u and v are coprime, so are v and w. Therefore, neither 3 nor 4 divide v.
Substituting u by w in the equation for z$^3$ yields
    −z$^3$ = 6w(9w$^2$ + 3v$^2$) = 18w(3w$^2$ + v$^2$)
Because v and w are coprime, and because 3 does not divide v, then 18w and 3w$^2$ + v$^2$ are also coprime. Therefore, since their product is a cube, they are each the cube of smaller integers, r and s
    18w = r$^3$
    3w$^2$ + v$^2$ = s$^3$
By the lemma above, since s is odd and its cube is equal to a number of the form 3w$^2$ + v$^2$, it too can be expressed in terms of smaller coprime numbers, e and f.
    s = e$^2$ + 3f$^2$
A short calculation shows that
    v = e(e$^2$ − 9f$^2$)
    w = 3f(e$^2$ − f$^2$)
Thus, e is odd and f is even, because v is odd. The expression for 18w then becomes
    r$^3$ = 18w = 54f(e$^2$ − f$^2$) = 54f(e + f)(e − f) = 3$^3$ × 2f(e + f)(e − f).
Since 3$^3$ divides r$^3$ we have that 3 divides r, so (⁠r/3⁠)$^3$ is an integer that equals 2f(e + f)(e − f). Since e and f are coprime, so are the three factors 2f, e + f, and e − f; therefore, they are each the cube of smaller integers, k, l, and m.
    −2f = k$^3$
    e + f = l$^3$
    f − e = m$^3$
which yields a smaller solution k$^3$ + l$^3$ + m$^3$ = 0. Therefore, by the argument of infinite descent, the original solution (x, y, z) was impossible.

## n = 5

Fermat's Last Theorem for n = 5 states that no three coprime integers x, y and z can satisfy the equation
    x$^5$ + y$^5$ + z$^5$ = 0
This was proven neither independently nor collaboratively by Dirichlet and Legendre around 1825. Alternative proofs were developed by Gauss, Lebesgue, Lamé, Gambioli, Werebrusow, Rychlik, van der Corput, and Terjanian.
Dirichlet's proof for n = 5 is divided into the two cases (cases I and II) defined by Sophie Germain. In case I, the exponent 5 does not divide the product xyz. In case II, 5 does divide xyz.
* Case I for n = 5 can be proven immediately by Sophie Germain's theorem(1823) if the auxiliary prime θ = 11.
* Case II is divided into the two cases (cases II(i) and II(ii)) by Dirichlet in 1825. Case II(i) is the case which one of x, y, z is divided by either 5 and 2. Case II(ii) is the case which one of x, y, z is divided by 5 and another one of x, y, z is divided by 2. In July 1825, Dirichlet proved the case II(i) for n = 5. In September 1825, Legendre proved the case II(ii) for n = 5. After Legendre's proof, Dirichlet completed the proof for the case II(ii) for n = 5 by the extended argument for the case II(i).
Chronological table of the proof of n = 5 :
| date | case I/II | case II(i/ii) | name |
| 1823 | case I | case I | Germain |
| July 1825 | case II | case II(i) | Dirichlet |
| September 1825 | case II | case II(ii) | Legendre |
| after September 1825 | case II | case II(ii) | Dirichlet |

### Proof for case A

Case A for n = 5 can be proven immediately by Sophie Germain's theorem if the auxiliary prime θ = 11. A more methodical proof is as follows. By Fermat's little theorem,
    x$^5$ ≡ x (mod 5)
    y$^5$ ≡ y (mod 5)
    z$^5$ ≡ z (mod 5)
and therefore
    x + y + z ≡ 0 (mod 5)
This equation forces two of the three numbers x, y, and z to be equivalent modulo 5, which can be seen as follows: Since they are indivisible by 5, x, y and z cannot equal 0 modulo 5, and must equal one of four possibilities: 1, −1, 2, or −2. If they were all different, two would be opposites and their sum modulo 5 would be zero (implying contrary to the assumption of this case that the other one would be 0 modulo 5).
Without loss of generality, x and y can be designated as the two equivalent numbers modulo 5. That equivalence implies that
    x$^5$ ≡ y$^5$ (mod 25) (note change in modulus)
    −z$^5$ ≡ x$^5$ + y$^5$ ≡ 2x$^5$ (mod 25)
However, the equation x ≡ y (mod 5) also implies that
    −z ≡ x + y ≡ 2x (mod 5)
    −z$^5$ ≡ 2$^5$x$^5$ ≡ 32x$^5$ (mod 25)
Combining the two results and dividing both sides by x$^5$ yields a contradiction
    2 ≡ 32 (mod 25) ≡ 7
Thus, case A for n = 5 has been proven.

### Proof for case B
## n = 7

The case n = 7 was proven by Gabriel Lamé in 1839. His rather complicated proof was simplified in 1840 by Victor-Amédée Lebesgue, and still simpler proofs were published by Angelo Genocchi in 1864, 1874 and 1876. Alternative proofs were developed by Théophile Pépin and Edmond Maillet.

## n = 6, n = 10, and n = 14

Fermat's Last Theorem has also been proven for the exponents n = 6, n = 10, and n = 14. Proofs for n = 6 have been published by Kausler, Thue, Tafelmacher, Lind, Kapferer, Swift, and Breusch. Similarly, Dirichlet and Terjanian each proved the case n = 14, while Kapferer and Breusch each proved the case n = 10. Strictly speaking, these proofs are unnecessary, since these cases follow from the proofs for n = 3, n = 5, n = 7, respectively. Nevertheless, the reasoning of these even-exponent proofs differs from their odd-exponent counterparts. Dirichlet's proof for n = 14 was published in 1832, before Lamé's 1839 proof for n = 7.