Proof of Fermat's Last Theorem for specific exponents

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Lua error in package.lua at line 80: module 'strict' not found.

Several proofs for Fermat's Last Theorem for specific exponents have been developed.

Mathematical preliminaries

Fermat's Last Theorem states that no three positive integers (a, b, c) can satisfy the equation an + bn = cn for any integer value of n greater than two. If n equals two, the equation has infinitely many solutions, the Pythagorean triples.

A solution (a, b, c) for a given n is equivalent to a solution for all the factors of n. For illustration, let n be factored into g and h, n = gh. Then (ag, bg, cg) is a solution for the exponent h

(ag)h + (bg)h = (cg)h

Conversely, 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 ap + bp = cp corresponds to a general integer solution to the equation ap + bp + cp = 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

bn = cn − an

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

an + bn = cn = gnxn + gnyn = gnzn

implies the equation

xn + yn = zn.

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 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.

In any primitive solution (x, y, z) to the equation xn  +  yn = zn, one number is even and the other two numbers are odd. They cannot all be even, for then they would not be coprime; they could all be divided by two. However, they cannot be all odd, since the sum of two odd numbers xn + yn is never an odd number zn. Therefore, at least one number must be even and at least one number must be odd. It follows that the third number is also odd, because the sum of an even and an odd number is itself odd.

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 re-arrangements 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

xp = 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 = rp and v = sp.

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 xp + yp = zp 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. <templatestyles src="Module:Hatnote/styles.css"></templatestyles>

Main article: Sophie Germain's theorem

n = 4

Portrait of Pierre de Fermat.

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.[1] This result is known as Fermat's right triangle theorem. As shown below, his proof is equivalent to demonstrating that the equation

x4 − y4 = z2

has no primitive solutions in integers (no pairwise coprime solutions). In turn, this is equivalent to proving Fermat's Last Theorem for the case n=4, since the equation a4 + b4 = c4 can be written as c4 − b4 = (a2)2. Alternative proofs of the case n = 4 were developed later[2] by Frénicle de Bessy,[3] Euler,[4] Kausler,[5] Barlow,[6] Legendre,[7] Schopis,[8] Terquem,[9] Bertrand,[10] Lebesgue,[11] Pepin,[12] Tafelmacher,[13] Hilbert,[14] Bendz,[15] Gambioli,[16] Kronecker,[17] Bang,[18] Sommer,[19] Bottari,[20] Rychlik,[21] Nutzhorn,[22] Carmichael,[23] Hancock,[24] Vrǎnceanu,[25] Grant and Perella,[26] Barbara,[27] and Dolan.[28] For one proof by infinite descent, see Infinite descent#Non-solvability of r2 + s4 = t4.

Application to right triangles

Fermat's proof demonstrates that no right triangle with integer sides can have an area that is a square.[29] Let the right triangle have sides (u, v, w), where the area equals uv/2 and, by the Pythagorean theorem, u2 + v2 = w2. If the area were equal to the square of an integer s

uv/2 = s2

then

(u + v)2 = w2 + 4s2
(u − v)2 = w2 − 4s2

Multiplying these equations together yields

(u2 − v2)2 = w4 − 24s4

But as Fermat proved, there can be no integer solution to the equation

x4 − y4 = z2

of which this is a special case with z = (u2 - v2), x = w and y = 2s.

The first step of Fermat's proof is to factor the left-hand side[30]

(x2 + y2)(x2 − y2) = z2

Since x and y are coprime (this can be assumed because otherwise the factors could be cancelled), the greatest common divisor of x2 + y2 and x2 − y2 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 (y2, z, x2) form a primitive Pythagorean triple, they can be written

z = 2de
y2 = d2 − e2
x2 = d2 + e2

where d and e are coprime and d > e > 0. Thus,

x2y2 = d4 − e4

which produces another solution (d, e, xy) that is smaller (0 < d < x). By the above argument that solutions cannot be shrunk indefinitely, this proves that the original solution was impossible.

Proof for Case B

In this case, the two factors are coprime. Since their product is a square z2, they must each be a square

x2 + y2 = s2
x2 − y2 = t2

The numbers s and t are both odd, since s2 + t2 = 2 x2, 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 y2 = 2uv, exactly one of them is even. For illustration, let u be even; then the numbers may be written as u=2m2 and v=k2. Since (u, v, x) form a primitive Pythagorean triple

(s2 + t2)/2 = u2 + v2 = x2

they can be expressed in terms of smaller integers d and e using Euclid's formula

u = 2de
v = d2 − e2
x = d2 + e2

Since u = 2m2 = 2de, and since d and e are coprime, they must be squares themselves, d = g2 and e = h2. This gives the equation

v = d2 − e2 = g4 − h4 = k2

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

Leonhard Euler by Jakob Emanuel Handmann.

Fermat sent the letters which had the problem as the case of n = 3 in 1636, 1640, 1657.[31] Euler sent the letter which he had the proof of the case of n = 3 to Goldbach at 4 August 1753.[32] Euler had the complete and pure elemental proof in 1760.[33] The case n = 3 was proven by Euler in 1770.[34][35][36][37] Independent proofs were published by several other mathematicians,[38] including Kausler,[5] Legendre,[7][39] Calzolari,[40] Lamé,[41] Tait,[42] Günther,[43] Gambioli,[16] Krey,[44] Rychlik,[21] Stockhaus,[45] Carmichael,[46] van der Corput,[47] Thue,[48] and Duarte.[49]

Chronological table of the proof of n = 3
date result/proof published/not published work name
1621 none published Latin version of Diophantus's Arithmetica Bachet
around 1630 only result not published a marginal note in Arithmetica Fermat
1636, 1640, 1657 only result published letters of n = 3 Fermat[31]
1670 only result published a marginal note in Arithmetica Fermat's son Samuel published the Arithmetica with Fermat's note.
4 August 1753 only result published letter to Goldbach Euler[32]
1760 proof not published complete and pure elemental proof Euler[33]
1770 proof published incomplete but elegant proof in Elements of Algebra Euler[32][34][37]

As Fermat did for the case n = 4, Euler used the technique of infinite descent.[50] The proof assumes a solution (x, y, z) to the equation x3 + y3 + z3 = 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 2x3 = −z3, 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

−z3 = (u + v)3 + (u − v)3 = 2u(u2 + 3v2)

Since u and v have opposite parity, u2 + 3v2 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 u2 + 3v2 is either 1 (case A) or 3 (case B).

Proof for Case A

In this case, the two factors of −z3 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 = r3
u2 + 3v2 = s3

Since u2 + 3v2 is odd, so is s. A crucial lemma shows that if s is odd and if it satisfies an equation s3 = u2 + 3v2, then it can be written in terms of two coprime integers e and f

s = e2 + 3f2

so that

u = e ( e2 − 9f2)
v = 3f ( e2 − f2)

Since u is even and v odd, then e is even and f is odd. Since

r3 = 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 = k3
e − 3f = l3
e + 3f = m3

which yields a smaller solution k3 + l3 + m3= 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 u2 + 3v2 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 z3 yields

−z3 = 6w(9w2 + 3v2) = 18w(3w2 + v2)

Because v and w are coprime, and because 3 does not divide v, then 18w and 3w2 + v2 are also coprime. Therefore, since their product is a cube, they are each the cube of smaller integers, r and s

18w = r3
3w2 + v2 = s3

By the lemma above, since s is odd and equal to a number of the form 3w2 + v2, it too can be expressed in terms of smaller coprime numbers, e and f.

s = e2 + 3f2

A short calculation shows that

v = e (e2 − 9f2)
w = 3f (e2 − f2)

Thus, e is odd and f is even, because v is odd. The expression for 18w then becomes

r3 = 18w = 54f (e2 − f2) = 54f (e + f) (e − f) = 33×2f (e + f) (e − f).

Since 33 divides r3 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 2e, e+f, and e−f; therefore, they are each the cube of smaller integers, k, l, and m.

−2e = k3
e + f = l3
e − f = m3

which yields a smaller solution k3 + l3 + m3= 0. Therefore, by the argument of infinite descent, the original solution (x, y, z) was impossible.

n = 5

Portrait of Peter Gustav Lejeune Dirichlet.
Caricature of Adrien-Marie Legendre (the only surviving portrait of him).

Fermat's Last Theorem for n = 5 states that no three coprime integers x, y and z can satisfy the equation

x5 + y5 + z5 = 0

This was proven[51] neither independently nor collaboratively by Dirichlet and Legendre around 1825.[32][52] Alternative proofs were developed[53] by Gauss,[54] Lebesgue,[55] Lamé,[56] Gambioli,[16][57] Werebrusow,[58] Rychlik,[59] van der Corput,[47] and Terjanian.[60]

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.

  1. Case I for n = 5 can be proven immediately by Sophie Germain's theorem(1823) if the auxiliary prime θ = 11.
  2. 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).[32]
Chronological table of the proof of n = 5
date case I/II case II(i/ii) name
1823 case I Sophie Germain
July 1825 case II case II(i) Dirichlet
September 1825 case II(ii) Legendre
after September 1825 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,

x5 ≡ x (mod 5)
y5 ≡ y (mod 5)
z5 ≡ 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 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

x5 ≡ y5 (mod 25) (note change in modulo)
−z5 ≡ x5 + y5 ≡ 2 x5 (mod 25)

However, the equation x ≡ y (mod 5) also implies that

−z ≡ x + y ≡ 2 x (mod 5)
−z5 ≡ 25 x5 ≡ 32 x5 (mod 25)

Combining the two results and dividing both sides by x5 yields a contradiction

2 ≡ 32 (mod 25)

Thus, case A for n = 5 has been proven.

Proof for Case B

Lua error in package.lua at line 80: module 'strict' not found.

n = 7

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

n = 6, 10, and 14

Fermat's Last Theorem has also been proven for the exponents n = 6, 10, and 14. Proofs for n = 6 have been published by Kausler,[5] Thue,[68] Tafelmacher,[69] Lind,[70] Kapferer,[71] Swift,[72] and Breusch.[73] Similarly, Dirichlet[74] and Terjanian[75] each proved the case n = 14, while Kapferer[71] and Breusch[73] each proved the case n = 10. Strictly speaking, these proofs are unnecessary, since these cases follow from the proofs for n = 3, 5, and 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.

Notes

  1. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  2. ↑ Ribenboim, pp. 15–24.
  3. ↑ Frénicle de Bessy, Traité des Triangles Rectangles en Nombres, vol. I, 1676, Paris. Reprinted in Mém. Acad. Roy. Sci., 5, 1666–1699 (1729).
  4. ↑ Lua error in package.lua at line 80: module 'strict' not found.. Reprinted Opera omnia, ser. I, "Commentationes Arithmeticae", vol. I, pp. 38–58, Leipzig:Teubner (1915).
  5. ↑ 5.0 5.1 5.2 Lua error in package.lua at line 80: module 'strict' not found.
  6. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  7. ↑ 7.0 7.1 Lua error in package.lua at line 80: module 'strict' not found. Reprinted in 1955 by A. Blanchard (Paris).
  8. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  9. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  10. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  11. ↑ Lua error in package.lua at line 80: module 'strict' not found.
    Lua error in package.lua at line 80: module 'strict' not found.
    Lua error in package.lua at line 80: module 'strict' not found.
  12. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  13. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  14. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in 1965 in Gesammelte Abhandlungen, vol. I by New York:Chelsea.
  15. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  16. ↑ 16.0 16.1 16.2 Lua error in package.lua at line 80: module 'strict' not found.
  17. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted by New York:Springer-Verlag in 1978.
  18. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  19. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  20. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  21. ↑ 21.0 21.1 Lua error in package.lua at line 80: module 'strict' not found.
  22. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  23. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  24. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  25. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in 1977 in Opera matematica, vol. 4, pp. 202–205, Bucureşti:Edit. Acad. Rep. Soc. Romana.
  26. ↑ Grant, Mike, and Perella, Malcolm, "Descending to the irrational", Mathematical Gazette 83, July 1999, pp.263-267.
  27. ↑ Barbara, Roy, "Fermat's last theorem in the case n=4", Mathematical Gazette 91, July 2007, 260-262.
  28. ↑ Dolan, Stan, "Fermat's method of descente infinie", Mathematical Gazette 95, July 2011, 269-271.
  29. ↑ Fermat P. "Ad Problema XX commentarii in ultimam questionem Arithmeticorum Diophanti. Area trianguli rectanguli in numeris non potest esse quadratus", Oeuvres, vol. I, p. 340 (Latin), vol. III, pp. 271–272 (French). Paris:Gauthier-Villars, 1891, 1896.
  30. ↑ Ribenboim, pp. 11–14.
  31. ↑ 31.0 31.1 Dickson (2005, p. 546)
  32. ↑ 32.0 32.1 32.2 32.3 32.4 O'Connor & Robertson (1996)
  33. ↑ 33.0 33.1 Bergmann (1966)
  34. ↑ 34.0 34.1 Euler L (1770) Vollständige Anleitung zur Algebra, Roy.Acad. Sci., St. Petersburg.
  35. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  36. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  37. ↑ 37.0 37.1 Euler (1822), pp. 399, 401–402
  38. ↑ Ribenboim, pp. 33, 37–41.
  39. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in 1825 as the "Second Supplément" for a printing of the 2nd edition of Essai sur la Théorie des Nombres, Courcier (Paris). Also reprinted in 1909 in Sphinx-Oedipe, 4, 97–128.
  40. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  41. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  42. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  43. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  44. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  45. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  46. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  47. ↑ 47.0 47.1 Lua error in package.lua at line 80: module 'strict' not found.
  48. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in Selected Mathematical Papers (1977), Oslo:Universitetsforlaget, pp. 555–559.
  49. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  50. ↑ Ribenboim, pp. 24–49.
  51. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  52. ↑ Ribenboim, p. 49.
  53. ↑ Ribenboim, pp. 55–57.
  54. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  55. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  56. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  57. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  58. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  59. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  60. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  61. ↑ Ribenboim, pp. 57–63.
  62. ↑ Lua error in package.lua at line 80: module 'strict' not found.
    Lua error in package.lua at line 80: module 'strict' not found.
  63. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  64. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  65. ↑ Lua error in package.lua at line 80: module 'strict' not found.
    Lua error in package.lua at line 80: module 'strict' not found.
    Lua error in package.lua at line 80: module 'strict' not found.
  66. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  67. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  68. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in Selected Mathematical Papers, pp. 19–30, Oslo:Universitetsforlaget (1977).
  69. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  70. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  71. ↑ 71.0 71.1 Lua error in package.lua at line 80: module 'strict' not found.
  72. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  73. ↑ 73.0 73.1 Lua error in package.lua at line 80: module 'strict' not found.
  74. ↑ Lua error in package.lua at line 80: module 'strict' not found. Reprinted in Werke, vol. I, pp. 189–194, Berlin:G. Reimer (1889); reprinted New York:Chelsea (1969).
  75. ↑ Lua error in package.lua at line 80: module 'strict' not found.

References

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
    • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.

Further reading

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found.

External links

  • Lua error in package.lua at line 80: module 'strict' not found.
  • Lua error in package.lua at line 80: module 'strict' not found. A blog that covers the history of Fermat's Last Theorem from Pierre Fermat to Andrew Wiles.
  • Lua error in package.lua at line 80: module 'strict' not found. Discusses various material which is related to the proof of Fermat's Last Theorem: elliptic curves, modular forms, Galois representations and their deformations, Frey's construction, and the conjectures of Serre and of Taniyama–Shimura.
  • Lua error in package.lua at line 80: module 'strict' not found. The story, the history and the mystery.
  • Lua error in package.lua at line 80: module 'strict' not found.
  • Weisstein, Eric W., "Fermat's Last Theorem", MathWorld.
  • Lua error in package.lua at line 80: module 'strict' not found. - University of St Andrews.
  • Lua error in package.lua at line 80: module 'strict' not found. The title of one edition of the PBS television series NOVA, discusses Andrew Wiles's effort to prove Fermat's Last Theorem.
  • Lua error in package.lua at line 80: module 'strict' not found. Edited version of ~2,000-word essay published in Prometheus magazine, describing Andrew Wiles's successful journey.
  • Lua error in package.lua at line 80: module 'strict' not found. Simon Singh and John Lynch's film tells the enthralling and emotional story of Andrew Wiles.
Retrieved from "https://infogalactic.com/w/index.php?title=Proof_of_Fermat%27s_Last_Theorem_for_specific_exponents&oldid=707204941"