Wednesday, 15 December 2010

Fermat's Last Theorem - Wikipedia, the free encyclopedia

From Wikipedia, the free encyclopedia

Jump to: navigation, search
For other theorems named after Pierre de Fermat, see Fermat's theorem.

The 1670 edition of Diophantus' Arithmetica includes Fermat's commentary, particularly his "Last Theorem" (Observatio Domini Petri de Fermat).

In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c can satisfy the equation an + bn = cn for any integer value of n greater than two. This theorem was first conjectured by Pierre de Fermat in 1637, famously in the margin of a copy of Arithmetica where he claimed he had a proof that was too large to fit in the margin. No successful proof was published until 1995 despite the efforts of many mathematicians. The unsolved problem stimulated the development of algebraic number theory in the 19th century and the proof of the modularity theorem in the 20th. It is among the most famous theorems in the history of mathematics and prior to its 1995 proof was in the Guinness Book of World Records for "most difficult math problem".

Fermat left no proof of the conjecture for all n, but he did prove the special case n = 4. (This case had already been proved by Leonardo Fibonacci in 1225 in his Liber quadratorum although this fact is often overlooked in discussions of Fermat's Last Theorem.) This reduced the problem to proving the theorem for exponents n that are prime numbers. Over the next two centuries (1637–1839), the conjecture was proven for only the primes 3, 5, and 7, although Sophie Germain proved a special case for all primes less than 100. In the mid-19th century, Ernst Kummer proved the theorem for a large (probably infinite) class of primes known as regular primes. Building on Kummer's work and using sophisticated computer studies, other mathematicians were able to prove the conjecture for all odd primes up to four million.

The final proof of the conjecture for all n came in the late 20th century. In 1984, Gerhard Frey suggested the approach of proving the conjecture through the modularity conjecture for elliptic curves. Building on work of Ken Ribet, Andrew Wiles succeeded in proving enough of the modularity conjecture to prove Fermat's Last Theorem, with the assistance of Richard Taylor. Wiles's achievement was reported widely in the popular press, and has been popularized in books and television programs.

Contents

[hide]

[edit] Mathematical context

[edit] Pythagorean triples

Main article: Pythagorean triple

Pythagorean triples are a set of three integers (a, b, c) that satisfy a special case of Fermat's equation (n = 2)[1]

a^2 + b^2 = c^2.\

Examples of Pythagorean triples include (3, 4, 5) and (5, 12, 13). There are infinitely many such triples,[2] and methods for generating such triples have been studied in many cultures, beginning with the Babylonians[3] and later ancient Greek, Chinese and Indian mathematicians.[4] The traditional interest in Pythagorean triples connects with the Pythagorean theorem;[5] in its converse form, it states that a triangle with sides of lengths a, b and c has a right angle between the a and b legs when the numbers are a triple. Right angles have various practical applications, such as surveying, carpentry, masonry and construction. Fermat's Last Theorem is an extension of this problem to higher powers, stating that no solution exists when the exponent 2 is replaced by a larger integer n.

[edit] Diophantine equations

Main article: Diophantine equation

Fermat's equation xn + yn = zn is an example of a Diophantine equation.[6] A Diophantine equation is a polynomial equation in which the solutions are required to be integers.[7] Their name derives from the 3rd century Alexandrian mathematician, Diophantus, who developed methods for their solution. A typical Diophantine equation is to find two integers x and y such that their sum, and the sum of their squares, equal two given numbers A and B, respectively

A = x + y\
B = x^2 + y^2.\

Diophantus' major work is the Arithmetica, of which only a portion has survived.[8] Fermat's conjecture of his Last Theorem was inspired while reading a new edition of the Arithmetica,[9] which was translated into Latin and published in 1621 by Claude Bachet.[10]

Diophantine equations have been studied for thousands of years. For example, the solutions to the quadratic Diophantine equation x2 + y2 = z2 are given by the Pythagorean triples, originally solved by the Babylonians (c. 1800 BC).[11] Solutions to linear Diophantine equations, such as 26x + 65y = 13, may be found using the Euclidean algorithm (c. 5th century BC).[12] The exponential Diophantine equation 3m = 2n ± 1 was solved by Gersonides in the 13th century.[13]

Many Diophantine equations have a form similar to the equation of Fermat's Last Theorem from the point of view of algebra, in that they have no cross terms mixing two letters, without sharing its particular properties. For example, it is known that there are infinitely many positive integers x, y, and z such that xn + yn = zm where n and m are relatively prime natural numbers.[14]

[edit] Fermat's conjecture

Problem II.8 in the 1621 edition of the Arithmetica of Diophantus. On the right is the famous margin which was too small to contain Fermat's alleged proof of his "last theorem".

Problem II.8 of the Arithmetica asks how to split a given square number into two other squares; in other words, for a given rational number k, find rational numbers u and v such that k2 = u2 + v2. Diophantus shows how to solve this sum-of-squares problem for k = 4 (the solutions being u = 16/5 and v = 12/5).[15]

Around 1637, Fermat wrote his Last Theorem in the margin of his copy of the Arithmetica next to Diophantus' sum-of-squares problem:[16]

Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et generaliter nullam in infinitum ultra quadratum potestatem in duos eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet. I have discovered a truly marvelous proof that it is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or in general, any power higher than the second into two like powers. This margin is too narrow to contain it.

Although Fermat's general proof is unknown, his proof of one case (n = 4) by infinite descent has survived.[17] Fermat posed the cases of n = 4 and of n = 3 as challenges to his mathematical correspondents, such as Marin Mersenne, Blaise Pascal, and John Wallis.[18] However, in the last thirty years of his life, Fermat never again wrote of his "truly marvellous proof" of the general case.

After Fermat's death in 1665, his son Clément-Samuel Fermat produced a new edition of the book (1670) augmented with his father's comments.[19] The margin note became known as Fermat's Last Theorem,[13] as it was the last of Fermat's asserted theorems to remain unproven.[20]

[edit] Proofs for specific exponents

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.[21] 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 proves 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[22] by Frénicle de Bessy (1676),[23] Leonhard Euler (1738),[24] Kausler (1802),[25] Peter Barlow (1811),[26] Adrien-Marie Legendre (1830),[27] Schopis (1825),[28] Terquem (1846),[29] Joseph Bertrand (1851),[30] Victor Lebesgue (1853, 1859, 1862),[31] Theophile Pepin (1883),[32] Tafelmacher (1893),[33] David Hilbert (1897),[34] Bendz (1901),[35] Gambioli (1901),[36] Leopold Kronecker (1901),[37] Bang (1905),[38] Sommer (1907),[39] Bottari (1908),[40] Karel Rychlík (1910),[41] Nutzhorn (1912),[42] Robert Carmichael (1913),[43] Hancock (1931),[44] and Vrǎnceanu (1966).[45]

After Fermat proved the special case n = 4, the general proof for all n required only that the theorem be established for all odd prime exponents.[46] In other words, it was necessary to prove only that the equation ap + bp = cp has no integer solutions (a, b, c) when p is an odd prime number. This follows because 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 d and e, n = de. The general equation

an + bn = cn

implies that (ad, bd, cd) is a solution for the exponent e

(ad)e + (bd)e = (cd)e

Thus, to prove that Fermat's equation has no solutions for n > 2, it suffices to prove that it has no solutions for at least one prime factor of every n. All integers n > 2 contain a factor of 4, or an odd prime number, or both. Therefore, Fermat's Last Theorem can be proven for all n if it can be proven for n = 4 and for all odd primes p.

In the two centuries following its conjecture (1637–1839), Fermat's Last Theorem was proven for three odd prime exponents p = 3, 5 and 7. The case p = 3 was first stated by Abu Mahmud Khujandi (10th century), but his attempted proof of the theorem was incorrect.[47] In 1770, Leonhard Euler gave a proof of p = 3,[48] but his proof by infinite descent[49] contained a major gap.[50] However, since Euler himself had proven the lemma necessary to complete the proof in other work, he is generally credited with the first proof.[51] Independent proofs were published[52] by Kausler (1802)[25], Legendre (1823, 1830),[27][53] Calzolari (1855),[54] Gabriel Lamé (1865),[55] Peter Guthrie Tait (1872),[56] Günther (1878),[57] Gambioli (1901),[36] Krey (1909),[58] Rychlík (1910),[41] Stockhaus (1910),[59] Carmichael (1915),[60] Johannes van der Corput (1915),[61], Axel Thue (1917),[62] and Duarte (1944).[63] The case p = 5 was proven[64] independently by Legendre and Peter Dirichlet around 1825.[65] Alternative proofs were developed[66] by Carl Friedrich Gauss (1875, posthumous),[67] Lebesgue (1843),[68] Lamé (1847),[69] Gambioli (1901),[36][70] Werebrusow (1905),[71] Rychlík (1910),[72] van der Corput (1915),[61] and Guy Terjanian (1987).[73] The case n = 7 was proven[74] by Lamé in 1839.[75] His rather complicated proof was simplified in 1840 by Lebesgue,[76] and still simpler proofs[77] were published by Angelo Genocchi in 1864, 1874 and 1876.[78] Alternative proofs were developed by Théophile Pépin (1876)[79] and Edmond Maillet (1897).[80]

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,[25] Thue,[81] Tafelmacher,[82] Lind,[83] Kapferer,[84] Swift,[85] and Breusch.[86] Similarly, Dirichlet[87] and Terjanian[88] each proved the case n = 14, while Kapferer[84] and Breusch[86] 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.[89]

Many proofs for specific exponents use Fermat's technique of infinite descent, which Fermat used to prove the case n = 4, but many do not. However, the details and auxiliary arguments are often ad hoc and tied to the individual exponent under consideration.[90] Since they became ever more complicated as p increased, it seemed unlikely that the general case of Fermat's Last Theorem could be proven by building upon the proofs for individual exponents.[90] Although some general results on Fermat's Last Theorem were published in the early 19th century by Niels Henrik Abel and Peter Barlow,[91][92] the first significant work on the general theorem was done by Sophie Germain.[93]

[edit] Sophie Germain

Main article: Sophie Germain

In the early 19th century, Sophie Germain developed several novel approaches to prove Fermat's last theorem for all exponents.[94] First, she defined a set of auxiliary primes θ constructed from the prime exponent p by the equation θ = 2hp+1, where h is any integer not divisible by three. She showed that if no integers raised to the pth power were adjacent modulo θ (the non-consecutivity condition), then θ must divide the product xyz. Her goal was to use mathematical induction to prove that, for any given p, infinitely many auxiliary primes θ satisfied the non-consecutivity condition and thus divided xyz; since the product xyz can have at most a finite number of prime factors, such a proof would have established Fermat's Last Theorem. Although she developed many techniques for establishing the non-consecutivity condition, she did not succeed in her strategic goal. She also worked to set lower limits on the size of solutions to Fermat's equation for a given exponent p, a modified version of which was published by Adrien-Marie Legendre. As a byproduct of this latter work, she proved Sophie Germain's theorem, which verified the first case of Fermat's Last Theorem for every odd prime exponent less than 100.[94][95] Germain tried unsuccessfully to prove the first case of Fermat's Last Theorem for all even exponents, specifically for n = 2p, which was proven by Guy Terjanian in 1977.[96] In 1985, Leonard Adleman, Roger Heath-Brown and Étienne Fouvry proved that the first case of Fermat's Last Theorem holds for infinitely many odd primes p.[97]

[edit] Ernst Kummer and the theory of ideals

In 1847, Gabriel Lamé outlined a proof of Fermat's Last Theorem based on factoring the equation xp + yp = zp in complex numbers, specifically the cyclotomic field based on the roots of the number 1. His proof failed, however, because it assumed incorrectly that such complex numbers can be factored uniquely into primes, similar to integers. This gap was pointed out immediately by Joseph Liouville, who later read a paper that demonstrated this failure of unique factorisation, written by Ernst Kummer.

Kummer set himself the task of determining whether the cyclotomic field could be generalized to include new prime numbers such that unique factorisation was restored. He succeeded in that task by developing the ideal numbers. Using the general approach outlined by Lamé, Kummer proved both cases of Fermat's Last Theorem for all regular prime numbers. However, he could not prove the theorem for the exceptional primes (irregular primes) which conjecturally occur approximately 39% of the time; the only irregular primes below 100 are 37, 59 and 67.

[edit] Mordell conjecture

In the 1920s, Louis Mordell posed a conjecture that implied that Fermat's equation has at most a finite number of nontrivial primitive integer solutions if the exponent n is greater than two.[98] This conjecture was proven in 1984 by Gerd Faltings,[99] and is now known as Faltings' theorem.

[edit] Computational studies

In the latter half of the 20th century, computational methods were used to extend Kummer's approach to the irregular primes. In 1954, Harry Vandiver used a SWAC computer to prove Fermat's Last Theorem for all primes up to 2521.[100] By 1978, Samuel Wagstaff had extended this to all primes less than 125,000.[101] By 1993, Fermat's Last Theorem had been proven for all primes less than four million.[102]

[edit] Connection with elliptic curves

The ultimately successful strategy for proving Fermat's Last Theorem was first described by Gerhard Frey in 1984.[103] Frey noted that if Fermat's equation had a solution (a, b, c) for exponent p>2, the corresponding elliptic curve[note 1]

y2 = x (x − ap)(x + bp)

would have such unusual properties that the curve would likely violate the Taniyama–Shimura conjecture.[104] This conjecture, first posed in the mid-1950s and gradually refined through the 1960s, states that every elliptic curve is modular, meaning that it can be associated with a unique modular form.

Following this strategy, the proof of Fermat's Last Theorem required two steps. First, it was necessary to show that Frey's intuition was correct, that the above elliptic curve is always non-modular. Frey did not succeed in proving this rigorously; the missing piece was identified by Jean-Pierre Serre. This missing piece, the so-called "epsilon conjecture", was proven by Ken Ribet in 1986. Second, it was necessary to prove a special case of the Taniyama-Shimura conjecture, raising it from a mere conjecture to a theorem. This special case (for semistable elliptic curves) was proven by Andrew Wiles in 1995. Summarizing, the epsilon conjecture showed that any solution to Fermat's equation could be used to generate a non-modular semistable elliptic curve, whereas Wiles' proof showed that all such elliptic curves must be modular. This contradiction implies that there can be no solutions to Fermat's equation, thus proving Fermat's Last Theorem.

[edit] Wiles' general proof

British mathematician Andrew Wiles

Ribet's proof of the epsilon conjecture in 1986 accomplished the first half of Frey's strategy for proving Fermat's Last Theorem. Upon hearing of Ribet's proof, Andrew Wiles decided to commit himself to accomplishing the second half: proving the Taniyama-Shimura conjecture for semistable elliptic curves.[105] Wiles worked on that task for six years in nearly complete secrecy. He based his initial approach on his area of expertise, Horizontal Iwasawa theory, but by the summer of 1991, this approach seemed inadequate to the task.[106] In response, he exploited a Euler system recently developed by Victor Kolyvagin and Matthias Flach. Since Wiles was unfamiliar with such methods, he asked his Princeton colleague, Nick Katz, to check his reasoning over the spring semester of 1993.[107]

By mid-1993, Wiles was sufficiently confident of his results that he presented them in three lectures delivered on June 21–23, 1993 at Isaac Newton Institute for Mathematical Sciences.[108] Specifically, Wiles presented his proof of the Taniyama–Shimura conjecture for semistable elliptic curves; together with Ribet's proof of the epsilon conjecture, this implied Fermat's Last Theorem. However, it soon became apparent that Wiles' initial proof was incorrect. A critical portion of the proof contained an error in a bound on the order of a particular group. The error was caught by several mathematicians refereeing Wiles' manuscript,[109] including Katz, who alerted Wiles on 23 August 1993.[110]

Wiles and his former student Richard Taylor spent almost a year trying to repair the proof, without success.[111] On 19 September 1994, Wiles had a flash of insight that the proof could be saved by returning to his original Horizontal Iwasawa theory approach, which he had abandoned in favour of the Kolyvagin-Flach approach.[112] On 24 October 1994, Wiles submitted two manuscripts, "Modular elliptic curves and Fermat's Last Theorem"[113] and "Ring theoretic properties of certain Hecke algebras",[114] the second of which was co-authored with Taylor. These papers were vetted and published in 1995 in the prestigious journal, Annals of Mathematics. These papers established the Taniyama-Shimura conjecture for semistable elliptic curves, the last step in proving Fermat's Last Theorem, 358 years after it was conjectured.

[edit] Did Fermat possess a general proof?

The mathematical techniques used in Fermat's "marvellous" proof are unknown. Only one detailed proof of Fermat has survived, the above proof that no three coprime integers (x, y, z) satisfy the equation x4 − y4 = z2.

Taylor and Wiles's proof relies on mathematical techniques developed in the twentieth century, which would be alien to mathematicians who had worked on Fermat's Last Theorem even a century earlier. Fermat's alleged "marvellous proof", by comparison, would have had to be elementary, given mathematical knowledge of the time, and so could not have been the same as Wiles' proof. Most mathematicians and science historians doubt that Fermat had a valid proof of his theorem for all exponents n.

Harvey Friedman's grand conjecture implies that Fermat's last theorem can be proved in elementary arithmetic, a rather weak form of arithmetic with addition, multiplication, exponentiation, and a limited form of induction for formulas with bounded quantifiers. [115] Any such proof would be elementary but possibly too long to write down.

[edit] Monetary prizes

In 1816 and again in 1850, the French Academy of Sciences offered a prize for a general proof of Fermat's Last Theorem.[116] In 1857, the Academy awarded 3000 francs and a gold medal to Kummer for his research on ideal numbers, although he had not submitted an entry for the prize.[117] Another prize was offered in 1883 by the Academy of Brussels.[118]

In 1908, the German industrialist and amateur mathematician Paul Wolfskehl bequeathed 100,000 marks to the Göttingen Academy of Sciences to be offered as a prize for a complete proof of Fermat's Last Theorem.[119] On 27 June 1908, the Academy published nine rules for awarding the prize. Among other things, these rules required that the proof be published in a peer-reviewed journal; the prize would not be awarded for two years after the publication; and that no prize would be given after 13 September 2007, roughly a century after the competition was begun.[120] Wiles collected the Wolfskehl prize money, then worth $50,000, on 27 June 1997.[121]

Prior to Wiles' proof, thousands of incorrect proofs were submitted to the Wolfskehl committee, amounting to roughly 10 feet (3 meters) of correspondence.[122] In the first year alone (1907–1908), 621 attempted proofs were submitted, although by the 1970s, the rate of submission had decreased to roughly 3–4 attempted proofs per month. According to F. Schlichting, a Wolfskehl reviewer, most of the proofs were based on elementary methods taught in schools, and often submitted by "people with a technical education but a failed career".[123] In the words of mathematical historian Howard Eves, "Fermat's Last Theorem has the peculiar distinction of being the mathematical problem for which the greatest number of incorrect proofs have been published."[118]

[edit] Rational Exponents

All solutions of the Diophantine equation an / m + bn / m = cn / m when n=1 are computed by Lenstra.[124] For n>2, Bennett, Glass, and Szekely [125] prove that if gcd(n,m)=1, then there are integer solutions if and only if 6 divides m, and a1 / m, b1 / m, and c1 / m are different complex 6th roots of the same real number.

[edit] See also

[edit] Footnotes

  1. ^ This elliptic curve was first suggested in the 1960s by Yves Hellegouarch, but he did not call attention to its non-modularity. For more details, see Hellegouarch, Yves (2001). Invitation to the Mathematics of Fermat-Wiles. Academic Press. ISBN 978-0123392510. 

[edit] References

  1. ^ Stark, pp. 151–155.
  2. ^ Stillwell J (2003). Elements of Number Theory. New York: Springer-Verlag. pp. 110–112. ISBN 0-387-95587-9. 
  3. ^ Aczel, pp. 13–15
  4. ^ Singh, pp. 18–20.
  5. ^ Singh, p. 6.
  6. ^ Stark, pp. 145–146.
  7. ^ Stark, p. 4–5.
  8. ^ Singh, pp. 50–51.
  9. ^ Stark, p. 145.
  10. ^ Aczel, pp. 44–45; Singh, pp. 56–58.
  11. ^ Aczel, pp. 14–15.
  12. ^ Stark, pp. 44–47.
  13. ^ a b Dickson, p. 731.
  14. ^ For example, \left((j^r+1)^s\right)^r + \left(j(j^r+1)^s)\right)^r = (j^r+1)^{rs+1}
  15. ^ Friberg, pp. 333– 334.
  16. ^ Dickson, p. 731; Singh, pp. 60–62; Aczel, p. 9.
  17. ^ Dickson, pp. 615–616; Aczel, p. 44.
  18. ^ Ribenboim, pp. 13, 24.
  19. ^ Singh, pp. 62–66.
  20. ^ Singh, p. 67; Aczel, p. 10.
  21. ^ Freeman L. "Fermat's One Proof". http://fermatslasttheorem.blogspot.com/2005/05/fermats-one-proof.html. Retrieved 23 May 2009. 
  22. ^ Ribenboim, pp. 15–24.
  23. ^ 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).
  24. ^ Euler L (1738). "Theorematum quorundam arithmeticorum demonstrationes". Comm. Acad. Sci. Petrop. 10: 125–146. . Reprinted Opera omnia, ser. I, "Commentationes Arithmeticae", vol. I, pp. 38–58, Leipzig:Teubner (1915).
  25. ^ a b c Kausler CF (1802). "Nova demonstratio theorematis nec summam, nec differentiam duorum cuborum cubum esse posse". Novi Acta Acad. Petrop. 13: 245–253. 
  26. ^ Barlow P (1811). An Elementary Investigation of Theory of Numbers. St. Paul's Church-Yard, London: J. Johnson. pp. 144–145. 
  27. ^ a b Legendre AM (1830). Théorie des Nombres (Volume II) (3rd ed.). Paris: Firmin Didot Frères.  Reprinted in 1955 by A. Blanchard (Paris).
  28. ^ Schopis (1825). Einige Sätze aus der unbestimmten Analytik. Gummbinnen: Programm. 
  29. ^ Terquem O (1846). "Théorèmes sur les puissances des nombres". Nouv. Ann. Math. 5: 70–87. 
  30. ^ Bertrand J (1851). Traité Élémentaire d'Algèbre. Paris: Hachette. pp. 217–230, 395. 
  31. ^ Lebesgue VA (1853). "Résolution des équations biquadratiques z2 = x4 ± 2my4, z2 = 2mx4 − y4, 2mz2 = x4 ± y4". J. Math. Pures Appl. 18: 73–86. 
    Lebesgue VA (1859). Exercices d'Analyse Numérique. Paris: Leiber et Faraguet. pp. 83–84, 89. 
    Lebesgue VA (1862). Introduction à la Théorie des Nombres. Paris: Mallet-Bachelier. pp. 71–73. 
  32. ^ Pepin T (1883). "Étude sur l'équation indéterminée ax4 + by4 = cz2". Atti Accad. Naz. Lincei 36: 34–70. 
  33. ^ Tafelmacher WLA (1893). "Sobre la ecuación x4 + y4 = z4". Ann. Univ. Chile 84: 307–320. 
  34. ^ Hilbert D (1897). "Die Theorie der algebraischen Zahlkörper". Jahresber. Deutsch. Math.-Verein 4: 175–546.  Reprinted in 1965 in Gesammelte Abhandlungen, vol. I by New York:Chelsea.
  35. ^ Bendz TR (1901). Öfver diophantiska ekvationen xn + yn = zn. Uppsala: Almqvist & Wiksells Boktrycken. 
  36. ^ a b c Gambioli D (1901). "Memoria bibliographica sull'ultimo teorema di Fermat". Period. Mat. 16: 145–192. 
  37. ^ Kronecker L (1901). Vorlesungen über Zahlentheorie, vol. I. Leipzig: Teubner. pp. 35–38.  Reprinted by New York:Springer-Verlag in 1978.
  38. ^ Bang A (1905). "Nyt Bevis for at Ligningen x4 − y4 = z4, ikke kan have rationale Løsinger". Nyt Tidsskrift Mat. 16B: 35–36. 
  39. ^ Sommer J (1907). Vorlesungen über Zahlentheorie. Leipzig: Teubner. 
  40. ^ Bottari A (1908). "Soluzione intere dell'equazione pitagorica e applicazione alla dimostrazione di alcune teoremi dellla teoria dei numeri". Period. Mat. 23: 104–110. 
  41. ^ a b Rychlik K (1910). "On Fermat's last theorem for n = 4 and n = 3 (in Bohemian)". Časopis Pěst. Mat. 39: 65–86. 
  42. ^ Nutzhorn F (1912). "Den ubestemte Ligning x4 + y4 = z4". Nyt Tidsskrift Mat. 23B: 33–38. 
  43. ^ Carmichael RD (1913). "On the impossibility of certain Diophantine equations and systems of equations". Amer. Math. Monthly (Mathematical Association of America) 20 (7): 213–221. doi:10.2307/2974106. http://jstor.org/stable/2974106. 
  44. ^ Hancock H (1931). Foundations of the Theory of Algebraic Numbers, vol. I. New York: Macmillan. 
  45. ^ Vrǎnceanu G (1966). "Asupra teorema lui Fermat pentru n=4". Gaz. Mat. Ser. A 71: 334–335.  Reprinted in 1977 in Opera matematica, vol. 4, pp. 202–205, Bucureşti:Edit. Acad. Rep. Soc. Romana.
  46. ^ Ribenboim, pp. 1–2.
  47. ^ Dickson, p. 545.
    O'Connor, John J.; Robertson, Edmund F., "Abu Mahmud Hamid ibn al-Khidr Al-Khujandi", MacTutor History of Mathematics archive, University of St Andrews, http://www-history.mcs.st-andrews.ac.uk/Biographies/Al-Khujandi.html .
  48. ^ Euler L (1770) Vollständige Anleitung zur Algebra, Roy. Acad. Sci., St. Petersburg.
  49. ^ Freeman L. "Fermat's Last Theorem: Proof for n = 3". http://fermatslasttheorem.blogspot.com/2005/05/fermats-last-theorem-proof-for-n3.html. Retrieved 23 May 2009. 
  50. ^ Ribenboim, pp. 24–25; Mordell, pp. 6–8; Edwards, pp. 39-40.
  51. ^ Aczel, p. 44; Edwards, pp. 40, 52-54.
    J. J. Mačys (2007). "On Euler’s hypothetical proof". Mathematical Notes 82 (3-4): 352–356. doi:10.1134/S0001434607090088. MR2364600. http://www.springerlink.com/content/u46jj0nuk3678591/. 
  52. ^ Ribenboim, pp. 33, 37–41.
  53. ^ Legendre AM (1823). "Recherches sur quelques objets d'analyse indéterminée, et particulièrement sur le théorème de Fermat". Mém. Acad. Roy. Sci. Institut France 6: 1–60.  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.
  54. ^ Calzolari L (1855). Tentativo per dimostrare il teorema di Fermat sull'equazione indeterminata xn + yn = zn. Ferrara. 
  55. ^ Lamé G (1865). "Étude des binômes cubiques x3 ± y3". C. R. Acad. Sci. Paris 61: 921–924, 961–965. 
  56. ^ Tait PG (1872). "Mathematical Notes". Proc. Roy. Soc. Edinburgh 7: 144. 
  57. ^ Günther S (1878). "Über die unbestimmte Gleichung x3 + y3 = z3". Sitzungsberichte Böhm. Ges. Wiss.: 112–120. 
  58. ^ Krey H (1909). "Neuer Beweis eines arithmetischen Satzes". Math. Naturwiss. Blätter 6: 179–180. 
  59. ^ Stockhaus H (1910). Beitrag zum Beweis des Fermatschen Satzes. Leipzig: Brandstetter. 
  60. ^ Carmichael RD (1915). Diophantine Analysis. New York: Wiley. 
  61. ^ a b van der Corput JG (1915). "Quelques formes quadratiques et quelques équations indéterminées". Nieuw Archief Wisk. 11: 45–75. 
  62. ^ Thue A (1917). "Et bevis for at ligningen A3 + B3 = C3 er unmulig i hele tal fra nul forskjellige tal A, B og C". Arch. Mat. Naturv. 34 (15).  Reprinted in Selected Mathematical Papers (1977), Oslo:Universitetsforlaget, pp. 555–559.
  63. ^ Duarte FJ (1944). "Sobre la ecuación x3 + y3 + z3 = 0". Ciencias Fis. Mat. Naturales (Caracas) 8: 971–979. 
  64. ^ Freeman L. "Fermat's Last Theorem: Proof for n = 5". http://fermatslasttheorem.blogspot.com/2005/10/fermats-last-theorem-proof-for-n5_28.html. Retrieved 23 May 2009. 
  65. ^ Ribenboim, p. 49; Mordell, p. 8–9; Aczel, p. 44; Singh, p. 106.
  66. ^ Ribenboim, pp. 55–57.
  67. ^ Gauss CF (1875, posthumous). "Neue Theorie der Zerlegung der Cuben". Zur Theorie der complexen Zahlen, Werke, vol. II (2nd ed.). Königl. Ges. Wiss. Göttingen. pp. 387–391. 
  68. ^ Lebesgue VA (1843). "Théorèmes nouveaux sur l'équation indéterminée x5 + y5 = az5". J. Math. Pures Appl. 8: 49–70. 
  69. ^ Lamé G (1847). "Mémoire sur la résolution en nombres complexes de l'équation A5 + B5 + C5 = 0". J. Math. Pures Appl. 12: 137–171. 
  70. ^ Gambioli D (1903/4). "Intorno all'ultimo teorema di Fermat". Il Pitagora 10: 11–13, 41–42. 
  71. ^ Werebrusow AS (1905). "On the equation x5 + y5 = Az5 (in Russian)". Moskov. Math. Samml. 25: 466–473. 
  72. ^ Rychlik K (1910). "On Fermat's last theorem for n = 5 (in Bohemian)". Časopis Pěst. Mat. 39: 185–195, 305–317. 
  73. ^ Terjanian G (1987). "Sur une question de V. A. Lebesgue". Ann. Inst. Fourier 37: 19–37. 
  74. ^ Ribenboim, pp. 57–63; Mordell, p. 8; Aczel, p. 44; Singh, p. 106.
  75. ^ Lamé G (1839). "Mémoire sur le dernier théorème de Fermat". C. R. Acad. Sci. Paris 9: 45–46. 
    Lamé G (1840). "Mémoire d'analyse indéterminée démontrant que l'équation x7 + y7 = z7 est impossible en nombres entiers". J. Math. Pures Appl. 5: 195–211. 
  76. ^ Lebesgue VA (1840). "Démonstration de l'impossibilité de résoudre l'équation x7 + y7 + z7 = 0 en nombres entiers". J. Math. Pures Appl. 5: 276–279, 348–349. 
  77. ^ Freeman L. "Fermat's Last Theorem: Proof for n = 7". http://fermatslasttheorem.blogspot.com/2006/01/fermats-last-theorem-proof-for-n7.html. Retrieved 23 May 2009. 
  78. ^ Genocchi A (1864). "Intorno all'equazioni x7 + y7 + z7 = 0". Annali Mat. 6: 287–288. 
    Genocchi A (1874). "Sur l'impossibilité de quelques égalités doubles". C. R. Acad. Sci. Paris 78: 433–436. 
    Genocchi A (1876). "Généralisation du théorème de Lamé sur l'impossibilité de l'équation x7 + y7 + z7 = 0". C. R. Acad. Sci. Paris 82: 910–913. 
  79. ^ Pepin T (1876). "Impossibilité de l'équation x7 + y7 + z7 = 0". C. R. Acad. Sci. Paris 82: 676–679, 743–747. 
  80. ^ Maillet E (1897). "Sur l'équation indéterminée axλt + byλt = czλt". Assoc. Française Avanc. Sci., St. Etienne (sér. II) 26: 156–168. 
  81. ^ Thue A (1896). "Über die Auflösbarkeit einiger unbestimmter Gleichungen". Det Kongel. Norske Videnskabers Selskabs Skrifter 7.  Reprinted in Selected Mathematical Papers, pp. 19–30, Oslo:Universitetsforlaget (1977).
  82. ^ Tafelmacher WLA (1897). "La ecuación x3 + y3 = z2: Una demonstración nueva del teorema de fermat para el caso de las sestas potencias". Ann. Univ. Chile, Santiago 97: 63–80. 
  83. ^ Lind B (1909). "Einige zahlentheoretische Sätze". Arch. Math. Phys. 15: 368–369. 
  84. ^ a b Kapferer H (1913). "Beweis des Fermatschen Satzes für die Exponenten 6 und 10". Archiv Math. Phys. 21: 143–146. 
  85. ^ Swift E (1914). "Solution to Problem 206". Amer. Math. Monthly 21: 238–239. 
  86. ^ a b Breusch R (1960). "A simple proof of Fermat's last theorem for n = 6, n = 10". Math. Mag. 33 (5): 279–281. doi:10.2307/3029800. http://jstor.org/stable/3029800. 
  87. ^ Dirichlet PGL (1832). "Démonstration du théorème de Fermat pour le cas des 14e puissances". J. Reine Angew. Math. 9: 390–393.  Reprinted in Werke, vol. I, pp. 189–194, Berlin:G. Reimer (1889); reprinted New York:Chelsea (1969).
  88. ^ Terjanian G (1974). "L'équation x14 + y14 = z14 en nombres entiers". Bull. Sci. Math. (sér. 2) 98: 91–95. 
  89. ^ Edwards, pp. 73-74.
  90. ^ a b Edwards, p. 74.
  91. ^ Dickson, p. 733.
  92. ^ Ribenboim P (1979). 13 Lectures on Fermat's Last Theorem. New York: Springer Verlag. pp. 51–54. ISBN 978-0387904320. 
  93. ^ Singh, pp. 97–109.
  94. ^ a b Laubenbacher R, Pengelley D (2007). "Voici ce que j'ai trouvé: Sophie Germain's grand plan to prove Fermat's Last Theorem". http://www.math.nmsu.edu/%7Edavidp/germain.pdf. Retrieved 19 May 2009. 
  95. ^ Aczel, p. 57.
  96. ^ Terjanian, G. (1977). "Sur l'équation x2p + y2p = z2p". Comptes rendus hebdomadaires des séances de l'Académie des sciences. Série a et B 285: 973–975. 
  97. ^ Adleman LM, Heath-Brown DR (June 1985). "The first case of Fermat's last theorem". Inventiones Mathematicae (Berlin: Springer) 79 (2): 409–416. doi:10.1007/BF01388981. 
  98. ^ Aczel, pp. 84–88; Singh, pp. 232–234.
  99. ^ Faltings G (1983). "Endlichkeitssätze für abelsche Varietäten über Zahlkörpern". Inventiones Mathematicae 73 (3): 349–366. doi:10.1007/BF01388432. 
  100. ^ Ribenboim P (1979). 13 Lectures on Fermat's Last Theorem. New York: Springer Verlag. p. 202. ISBN 978-0387904320. 
  101. ^ Wagstaff SS, Jr. (1978). "The irregular primes to 125000". Math. Comp. (American Mathematical Society) 32 (142): 583–591. doi:10.2307/2006167. http://jstor.org/stable/2006167.  (PDF)
  102. ^ Buhler J, Crandell R, Ernvall R, Metsänkylä T (1993). "Irregular primes and cyclotomic invariants to four million". Math. Comp. (American Mathematical Society) 61 (203): 151–153. doi:10.2307/2152942. http://jstor.org/stable/2152942. 
  103. ^ Singh, pp. 194–198; Aczel, pp. 109–114.
  104. ^ Frey G (1986). "Links between stable elliptic curves and certain diophantine equations". Ann. Univ. Sarav. Ser. Math. 1: 1–40. 
  105. ^ Singh, p. 205; Aczel, pp. 117–118.
  106. ^ Singh, pp. 237–238; Aczel, pp. 121–122.
  107. ^ Singh, pp. 239–243; Aczel, pp. 122–125.
  108. ^ Singh, pp. 244–253; Aczel, pp. 1–4, 126–128.
  109. ^ Aczel, pp. 128–130.
  110. ^ Singh, p. 257.
  111. ^ Singh, pp. 269–274.
  112. ^ Singh, pp. 275–277; Aczel, pp. 132–134.
  113. ^ Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem" (PDF). Annals of Mathematics (Annals of Mathematics) 141 (3): 443–551. doi:10.2307/2118559. OCLC 37032255. http://math.stanford.edu/~lekheng/flt/wiles.pdf. 
  114. ^ Taylor R, Wiles A (1995). "Ring theoretic properties of certain Hecke algebras". Annals of Mathematics (Annals of Mathematics) 141 (3): 553–572. doi:10.2307/2118560. OCLC 37032255. http://www.math.harvard.edu/~rtaylor/hecke.ps. 
  115. ^ Avigad, Jeremy (2003). "Number theory and elementary arithmetic". Philosophia Mathematica. Philosophy of Mathematics, its Learning, and its Application. Series III 11 (3): 257–284. doi:10.1093/philmat/11.3.257. MR2006194. ISSN 0031-8019. Preprint
  116. ^ Aczel, p. 69; Singh, p. 105.
  117. ^ Aczel, p. 69.
  118. ^ a b Koshy T (2001). Elementary number theory with applications. New York: Academic Press. p. 544. ISBN 978-0124211711. 
  119. ^ Singh, pp. 120–125, 131–133, 295–296; Aczel, p. 70.
  120. ^ Singh, pp. 120–125.
  121. ^ Singh, p. 284
  122. ^ Singh, p. 295.
  123. ^ Singh, pp. 295–296.
  124. ^ Lenstra, Jr. H.W. (1992). On the inverse Fermat equation. Discrete Mathematics, 106-107, pp. 329-331.
  125. ^ Bennett, Curt D., Glass, Andrew M.W., and Székely, Gábor J. (2004). Fermat’s last theorem for rational exponents. The American Mathematical Monthly, 111, no. 4, pp. 322-329.

[edit] Bibliography

[edit] Further reading

[edit] External links

Wikibooks has more on the topic of

via en.wikipedia.org

Posted via email from projectbrainsaver

Posted by at