Fermat's Last Theorem

From formulasearchengine
Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}} {{ safesubst:#invoke:Unsubst||$N=Use dmy dates |date=__DATE__ |$B= }}

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 (sometimes called Fermat's conjecture, especially in older texts) 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 in the margin of a copy of Arithmetica where he claimed he had a proof that was too large to fit in the margin. The first successful proof was released in 1994 by Andrew Wiles, and formally published in 1995, after 358 years of effort by 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 century. It is among the most notable theorems in the history of mathematics and prior to its proof it was in the Guinness Book of World Records for "most difficult mathematical problems".


Fermat's Last Theorem stood as an unsolved riddle in mathematics for over three and a half centuries. The theorem itself is a deceptively simple statement that Fermat stated he had proved around 1637. His claim was discovered some 30 years later, after his death, written in the margin of a book, but with no proof provided.

The claim eventually became one of the most notable unsolved problems of mathematics. Attempts to prove it prompted substantial development in number theory, and over time Fermat's Last Theorem gained prominence as an unsolved problem in popular mathematics. It is based on the Pythagorean theorem, which states that a2 + b2 = c2, where a and b are the lengths of the legs of a right triangle and c is the length of the hypotenuse.

The Pythagorean equation has an infinite number of positive integer solutions for a, b, and c; these solutions are known as Pythagorean triples. Fermat stated that the more general equation an + bn = cn had no solutions in positive integers, if n is an integer greater than 2. Although he claimed to have a general proof of his conjecture, Fermat left no details of his proof apart from the special case n = 4.

Subsequent developments and solution

With the special case n = 4 proven, the problem was to prove the theorem for exponents n that are prime numbers (this limitation is considered trivial to prove[note 1]). Over the next two centuries (1637–1839), the conjecture was proven for only the primes 3, 5, and 7, although Sophie Germain innovated and proved an approach that was relevant to an entire class of primes. In the mid-19th century, Ernst Kummer extended this and proved the theorem for all regular primes, leaving irregular primes to be analyzed individually. Building on Kummer's work and using sophisticated computer studies, other mathematicians were able to extend the proof to cover all prime exponents up to four million, but a proof for all exponents was inaccessible (meaning that mathematicians generally considered a proof to be either impossible, or at best exceedingly difficult, or not achievable with current knowledge).

The proof of Fermat's Last Theorem in full, for all n, was finally accomplished, however, after 357 years, by Andrew Wiles in 1994, an achievement for which he was honoured and received numerous awards. The solution came in a roundabout manner, from a completely different area of mathematics.

Around 1955 Japanese mathematicians Goro Shimura and Yutaka Taniyama suspected a link might exist between elliptic curves and modular forms, two completely different areas of mathematics. Known at the time as the Taniyama–Shimura-Weil conjecture, and (eventually) as the modularity theorem, it stood on its own, with no apparent connection to Fermat's Last Theorem. It was widely seen as significant and important in its own right, but was (like Fermat's equation) widely considered to be completely inaccessible to proof.

In 1984, Gerhard Frey noticed an apparent link between the modularity theorem and Fermat's Last Theorem. This potential link was confirmed two years later by Ken Ribet (see: Ribet's Theorem and Frey curve). On hearing this, English mathematician Andrew Wiles, who had a childhood fascination with Fermat's Last Theorem, decided to try to prove the modularity theorem as a way to prove Fermat's Last Theorem. In 1993, after six years working secretly on the problem, Wiles succeeded in proving enough of the modularity theorem to prove Fermat's Last Theorem. Wiles' paper was massive in size and scope. A flaw was discovered in one part of his original paper during peer review and required a further year and collaboration with a past student, Richard Taylor, to resolve. As a result, the final proof in 1995 was accompanied by a second, smaller, joint paper to that effect. Wiles's achievement was reported widely in the popular press, and was popularized in books and television programs. The remaining parts of the modularity theorem were subsequently proven by other mathematicians, building on Wiles's work, between 1996 and 2001.

Mathematical history

Pythagoras and Diophantus

Pythagorean triples


A Pythagorean triple – named for the ancient Greek Pythagoras – is a set of three integers (a, b, c) that satisfy a special case of Fermat's equation (n = 2)[1]

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 Pythagorean 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 any larger integer.

Diophantine equations


Fermat's equation, xn + yn = zn with positive integer solutions, is an example of a Diophantine equation,[6] named for the 3rd-century Alexandrian mathematician, Diophantus, who studied them and developed methods for the solution of some kinds of Diophantine equations. A typical Diophantine problem 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:

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

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).[10] Solutions to linear Diophantine equations, such as 26x + 65y = 13, may be found using the Euclidean algorithm (c. 5th century BC).[11] 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.[note 2]

Fermat's conjecture

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

Problem II.8 of the Arithmetica asks how a given square number is split 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).[12]

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

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. 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. I have discovered a truly marvellous proof of this, which this margin is too narrow to contain.[14][15]

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.[16] The margin note became known as Fermat’s Last Theorem,[17] as it was the last of Fermat’s asserted theorems to remain unproven.[18]

It is not known whether Fermat had actually found a valid proof for all exponents n, but it appears unlikely. Only one related proof by him has survived, namely for the case n = 4, as described in the section Proofs for specific exponents. While 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,[19] he never posed the general case.[20] Moreover, in the last thirty years of his life, Fermat never again wrote of his “truly marvellous proof” of the general case, and never published it. Van der Poorten[21] suggests that while the absence of a proof is insignificant, the lack of challenges means Fermat realised he did not have a proof; he quotes Weil[22] as saying Fermat must have briefly deluded himself with an irretrievable idea.

The techniques Fermat might have used in such a “marvellous proof” are unknown.

Taylor and Wiles’s proof relies on 20th century techniques.[23] Fermat’s proof would have had to have been elementary by comparison, given the mathematical knowledge of his time.

While Harvey Friedman’s grand conjecture implies that any provable theorem (including Fermat’s last theorem) can be proved using only ‘elementary function arithmetic’, such a proof need only be ‘elementary’ in a technical sense but could involve millions of steps, and thus be far too long to have been Fermat’s proof.

Proofs for specific exponents


Only one relevant proof by Fermat has survived, in which he 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.[24][25] His proof is equivalent to demonstrating that the equation

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 c4b4 = (a2)2.

Alternative proofs of the case n = 4 were developed later[26] by Frénicle de Bessy (1676),[27] Leonhard Euler (1738),[28] Kausler (1802),[29] Peter Barlow (1811),[30] Adrien-Marie Legendre (1830),[31] Schopis (1825),[32] Terquem (1846),[33] Joseph Bertrand (1851),[34] Victor Lebesgue (1853, 1859, 1862),[35] Theophile Pepin (1883),[36] Tafelmacher (1893),[37] David Hilbert (1897),[38] Bendz (1901),[39] Gambioli (1901),[40] Leopold Kronecker (1901),[41] Bang (1905),[42] Sommer (1907),[43] Bottari (1908),[44] Karel Rychlík (1910),[45] Nutzhorn (1912),[46] Robert Carmichael (1913),[47] Hancock (1931),[48] and Vrǎnceanu (1966).[49]

For another proof for n=4 by infinite descent, see Infinite descent: Non-solvability of r2 + s4 = t4. For various proofs for n=4 by infinite descent, see Grant and Perella (1999),[50] Barbara (2007),[51] and Dolan (2011).[52]

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.[53] In other words, it was necessary to prove only that the equation an + bn = cn has no integer solutions (a, b, c) when n is an odd prime number. This follows because a solution (abc) 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 (adbdcd) 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 (the only even prime number is the number 2).

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 Khojandi (10th century), but his attempted proof of the theorem was incorrect.[54] In 1770, Leonhard Euler gave a proof of p = 3,[55] but his proof by infinite descent[56] contained a major gap.[57] However, since Euler himself had proven the lemma necessary to complete the proof in other work, he is generally credited with the first proof.[58] Independent proofs were published[59] by Kausler (1802),[29] Legendre (1823, 1830),[31][60] Calzolari (1855),[61] Gabriel Lamé (1865),[62] Peter Guthrie Tait (1872),[63] Günther (1878),[64] Gambioli (1901),[40] Krey (1909),[65] Rychlík (1910),[45] Stockhaus (1910),[66] Carmichael (1915),[67] Johannes van der Corput (1915),[68] Axel Thue (1917),[69] and Duarte (1944).[70] The case p = 5 was proven[71] independently by Legendre and Peter Gustav Lejeune Dirichlet around 1825.[72] Alternative proofs were developed[73] by Carl Friedrich Gauss (1875, posthumous),[74] Lebesgue (1843),[75] Lamé (1847),[76] Gambioli (1901),[40][77] Werebrusow (1905),[78] Rychlík (1910),[79] van der Corput (1915),[68] and Guy Terjanian (1987).[80] The case p = 7 was proven[81] by Lamé in 1839.[82] His rather complicated proof was simplified in 1840 by Lebesgue,[83] and still simpler proofs[84] were published by Angelo Genocchi in 1864, 1874 and 1876.[85] Alternative proofs were developed by Théophile Pépin (1876)[86] and Edmond Maillet (1897).[87]

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,[29] Thue,[88] Tafelmacher,[89] Lind,[90] Kapferer,[91] Swift,[92] and Breusch.[93] Similarly, Dirichlet[94] and Terjanian[95] each proved the case n = 14, while Kapferer[91] and Breusch[93] 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.[96]

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.[97] 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.[97] Although some general results on Fermat's Last Theorem were published in the early 19th century by Niels Henrik Abel and Peter Barlow,[98][99] the first significant work on the general theorem was done by Sophie Germain.[100]

Sophie Germain


In the early 19th century, Sophie Germain developed several novel approaches to prove Fermat's Last Theorem for all exponents.[101] 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 (namely, the case in which p does not divide xyz) for every odd prime exponent less than 100.[101][102] 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.[103] 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.[104]

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) that conjecturally occur approximately 39% of the time; the only irregular primes below 100 are 37, 59 and 67.

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.[105] This conjecture was proven in 1983 by Gerd Faltings,[106] and is now known as Faltings' theorem.

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.[107] By 1978, Samuel Wagstaff had extended this to all primes less than 125,000.[108] By 1993, Fermat's Last Theorem had been proven for all primes less than four million.[109]

However despite these efforts and their results, no proof existed of Fermat's Last Theorem. Proofs of individual exponents by their nature could never prove the general case: even, if all exponents were verified up to an extremely large number X, a higher exponent beyond X might still exist for which the claim was not true. (This had been the case with some other past conjectures, and it could not be ruled out in this conjecture.)

Connection with elliptic curves

The strategy that ultimately led to a successful proof of Fermat's Last Theorem arose from the "astounding"[110]:211 Taniyama–Shimura-Weil conjecture, proposed around 1955, which many mathematicians believed would be near to impossible to prove,[110]:223 and which was linked in the 1980s by Gerhard Frey, Jean-Pierre Serre and Ken Ribet to Fermat's equation. By accomplishing a partial proof of this conjecture in 1994, Andrew Wiles ultimately succeeded in proving Fermat's Last Theorem, as well as leading the way to a full proof by others of what is now the modularity theorem.

Taniyama–Shimura–Weil conjecture

{{#invoke:main|main}} Around 1955, Japanese mathematicians Goro Shimura and Yutaka Taniyama observed a possible link between two apparently completely distinct branches of mathematics, elliptic curves and modular forms. The resulting modularity theorem (at the time known as the Taniyama–Shimura conjecture) states that every elliptic curve is modular, meaning that it can be associated with a unique modular form.

It was initially dismissed as unlikely or highly speculative, and was taken more seriously when number theorist André Weil found evidence supporting it, but no proof; as a result the conjecture was often known as the Taniyama–Shimura-Weil conjecture. It became a part of the Langlands programme, a list of important conjectures needing proof or disproof.[110]:211–215

Even after gaining serious attention, the conjecture was seen by contemporary mathematicians as extraordinarily difficult or perhaps inaccessible to proof.[110]:203–205, 223, 226 For example, Wiles' ex-supervisor John Coates states that it seemed "impossible to actually prove",[110]:226 and Ken Ribet considered himself "one of the vast majority of people who believed [it] was completely inaccessible", adding that "Andrew Wiles was probably one of the few people on earth who had the audacity to dream that you can actually go and prove [it]."[110]:223

Frey's equation / Ribet's theorem

{{#invoke:main|main}} In 1984, Gerhard Frey noted a link between Fermat's equation and the modularity theorem, then still a conjecture. If Fermat's equation had any solution (a, b, c) for exponent p > 2, then it could be shown that the elliptic curve (now known as a Frey curve [note 3])

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

would have such unusual properties that it was unlikely to be modular.[111] This would conflict with the modularity theorem, which asserted that all elliptic curves are modular. As such, Frey observed that a proof of the Taniyama–Shimura-Weil conjecture would simultaneously prove Fermat's Last Theorem[112] and equally, a disproof or refutation of Fermat's Last Theorem would disprove the conjecture.

Following this strategy, a proof of Fermat's Last Theorem required two steps. First, it was necessary to show that Frey's intuition was correct: that if an elliptic curve were constructed in this way, using a set of numbers that were a solution of Fermat's equation, the resulting elliptic curve could not be modular. Frey did not quite succeed in proving this rigorously; the missing piece (the so-called "epsilon conjecture", now known as Ribet's theorem) was identified by Jean-Pierre Serre{{ safesubst:#invoke:Unsubst||date=__DATE__ |$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} and proven in 1986 by Ken Ribet. Second, it was necessary to prove the modularity theorem – or at least to prove it for the sub-class of cases (known as semistable elliptic curves) that included Frey's equation – and this was widely believed inaccessible to proof by contemporary mathematicians.[110]:203–205, 223, 226

  • The modularity theorem – if proven – would mean all elliptic curves (or at least all semistable elliptic curves) are of necessity modular.
  • Ribet's theorem – proven in 1986 – showed that, if a solution to Fermat's equation existed, it could be used to create a semistable elliptic curve that was not modular;
  • The contradiction would imply (if the modularity theorem were correct) that no solutions can exist to Fermat's equation – therefore proving Fermat's Last Theorem.

Wiles's general proof

British mathematician Andrew Wiles


Ribet's proof of the epsilon conjecture in 1986 accomplished the first of the two goals proposed by Frey. Upon hearing of Ribet's success, Andrew Wiles, an English mathematician with a childhood fascination with Fermat's Last Theorem, and a prior study area of elliptical equations, decided to commit himself to accomplishing the second half: proving a special case of the modularity theorem (then known as the Taniyama–Shimura conjecture) for semistable elliptic curves.[113]

Wiles worked on that task for six years in near-total secrecy, covering up his efforts by releasing prior work in small segments as separate papers and confiding only in his wife.[110]:229–230 His initial study suggested proof by induction,[110]:230–232, 249–252 and he based his initial work and first significant breakthrough on Galois theory[110]:251–253, 259 before switching to an attempt to extend Horizontal Iwasawa theory for the inductive argument around 1990–91 when it seemed that there was no existing approach adequate to the problem.[110]:258–259 However, by the summer of 1991, Iwasawa theory also seemed to not be reaching the central issues in the problem.[110]:259–260[114] In response, he approached colleagues to seek out any hints of cutting edge research and new techniques, and discovered an Euler system recently developed by Victor Kolyvagin and Matthias Flach that seemed "tailor made" for the inductive part of his proof.[110]:260–261 Wiles studied and extended this approach, which worked. Since his work relied extensively on this approach, which was new to mathematics and to Wiles, in January 1993 he asked his Princeton colleague, Nick Katz, to check his reasoning for subtle errors. Their conclusion at the time was that the techniques used by Wiles seemed to be working correctly.[110]:261–265[115]

By mid-May 1993 Wiles felt able to tell his wife he thought he had solved the proof of Fermat's Last Theorem,[110]:265 and by June he felt sufficiently confident to present his results in three lectures delivered on 21–23 June 1993 at the Isaac Newton Institute for Mathematical Sciences.[116] 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 became apparent during peer review that a critical point in the proof was incorrect. It contained an error in a bound on the order of a particular group. The error was caught by several mathematicians refereeing Wiles's manuscript including Katz (in his role as reviewer),[117] who alerted Wiles on 23 August 1993.[118]

The error would not have rendered his work worthless – each part of Wiles' work was highly significant and innovative by itself, as were the many developments and techniques he had created in the course of his work, and only one part was affected.[110]:289, 296–297 However without this part proven, there was no actual proof of Fermat's Last Theorem. Wiles spent almost a year trying to repair his proof, initially by himself and then in collaboration with Richard Taylor, without success.[119]

On 19 September 1994, on the verge of giving up, 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, this time strengthening it with expertise gained in Kolyvagin–Flach's approach.[120] On 24 October 1994, Wiles submitted two manuscripts, "Modular elliptic curves and Fermat's Last Theorem"[121] and "Ring theoretic properties of certain Hecke algebras",[122] the second of which was co-authored with Taylor and proved that certain conditions were met that were needed to justify the corrected step in the main paper. The two papers were vetted and published as the entirety of the May 1995 issue of the Annals of Mathematics. These papers established the modularity theorem for semistable elliptic curves, the last step in proving Fermat's Last Theorem, 358 years after it was conjectured.

Subsequent developments

The full Taniyama–Shimura–Weil conjecture was finally proved by Template:Harvtxt, Template:Harvtxt, and Template:Harvtxt who, building on Wiles' work, incrementally chipped away at the remaining cases until the full result was proved. The now fully proved conjecture became known as the modularity theorem.

Several other theorems in number theory similar to Fermat's Last Theorem also follow from the same reasoning, using the modularity theorem. For example: no cube can be written as a sum of two coprime n-th powers, n ≥ 3. (The case n = 3 was already known by Euler.)

Exponents other than positive integers

Reciprocal Integers (Inverse Fermat Equation)

The equation can be considered the "inverse" Fermat equation. All solutions of this equation were computed by Lenstra in 1992.[123] In the case in which the mth roots are required to be real and positive, all solutions are given by[124]

for positive integers r, s, t with s and t coprime.

Rational exponents

For the Diophantine equation with n not equal to 1, in 2004, for n > 2, Bennett, Glass, and Szekely proved that if n and m are coprime, then there are integer solutions if and only if 6 divides m, and , and are different complex 6th roots of the same real number.[125]

Negative exponents

n = –1

All primitive (pairwise coprime) integer solutions to can be written as[126]

for positive, coprime integers m, n.

n = –2

The case n = –2 also has an infinitude of solutions, and these have a geometric interpretation in terms of right triangles with integer sides and an integer altitude to the hypotenuse.[127][128] All primitive solutions to are given by

for coprime integers u, v with v > u. The geometric interpretation is that a and b are the integer legs of a right triangle and d is the integer altitude to the hypotenuse. Then the hypotenuse itself is the integer

so (a, b, c) is a Pythagorean triple.

Integer n < –2

There are no solutions in integers for for integers n < –2. If there were, the equation could be multiplied through by to obtain , which is impossible by Fermat's Last Theorem.

Values other than positive integers

Fermat's last theorem can easily be extended to positive rationals:

can have no solutions, because any solution could be rearranged as:


to which Fermat's Last Theorem applies.

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.[129] 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.[130] Another prize was offered in 1883 by the Academy of Brussels.[131]

In 1908, the German industrialist and amateur mathematician Paul Wolfskehl bequeathed 100,000 gold marks, a very large sum at that time, to the Göttingen Academy of Sciences to be offered as a prize for a complete proof of Fermat's Last Theorem.[132] 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 until two years after the publication; and that no prize would be given after 13 September 2007, roughly a century after the competition was begun.[133] Wiles collected the Wolfskehl prize money, then worth $50,000, on 27 June 1997.[134]

Prior to Wiles' proof, thousands of incorrect proofs were submitted to the Wolfskehl committee, amounting to roughly 10 feet (3 meters) of correspondence.[135] 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".[136] 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."[131]

See also


  1. If the exponent "n" were not prime or 4, then it would be possible to write n either as a product of two smaller integers (n = P*Q) in which P is a prime number greater than 2, and then an = aP*Q = (aQ)P for each of a, b, and c, i.e. an equivalent solution would also have to exist for the prime power P that is smaller than N, as well; or else as n would be a power of 2 greater than four and writing n=4*Q, the same argument would hold.
  2. For example,
  3. This elliptic curve was first suggested in the 1960s by Template:Ill, but he did not call attention to its non-modularity. For more details, see {{#invoke:citation/CS1|citation |CitationClass=book }}


  1. Stark, pp. 151–155.
  2. {{#invoke:citation/CS1|citation |CitationClass=book }}
  3. Aczel, pp. 13–15
  4. Singh, pp. 18–20.
  5. Singh, p. 6.
  6. Stark, pp. 145–146.
  7. Singh, pp. 50–51.
  8. Stark, p. 145.
  9. Aczel, pp. 44–45; Singh, pp. 56–58.
  10. Aczel, pp. 14–15.
  11. Stark, pp. 44–47.
  12. Friberg, pp. 333– 334.
  13. Dickson, p. 731; Singh, pp. 60–62; Aczel, p. 9.
  14. T. Heath, Diophantus of Alexandria Second Edition, Cambridge University Press, 1910, reprinted by Dover, NY, 1964, pp. 144-145
  15. Panchishkin, p. 341
  16. Singh, pp. 62–66.
  17. Dickson, p. 731.
  18. Singh, p. 67; Aczel, p. 10.
  19. Ribenboim, pp. 13, 24.
  20. van der Poorten, Notes and Remarks 1.2, p. 5.
  21. van der Poorten, loc. cit.
  22. {{#invoke:citation/CS1|citation |CitationClass=book }}
  23. BBC Documentary
  24. Template:Cite web
  25. Dickson, pp. 615–616; Aczel, p. 44.
  26. Ribenboim, pp. 15–24.
  27. 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).
  28. {{#invoke:Citation/CS1|citation |CitationClass=journal }}. Reprinted Opera omnia, ser. I, "Commentationes Arithmeticae", vol. I, pp. 38–58, Leipzig:Teubner (1915).
  29. 29.0 29.1 29.2 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  30. {{#invoke:citation/CS1|citation |CitationClass=book }}
  31. 31.0 31.1 {{#invoke:citation/CS1|citation |CitationClass=book }} Reprinted in 1955 by A. Blanchard (Paris).
  32. {{#invoke:citation/CS1|citation |CitationClass=book }}
  33. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  34. {{#invoke:citation/CS1|citation |CitationClass=book }}
  35. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
    {{#invoke:citation/CS1|citation |CitationClass=book }}
    {{#invoke:citation/CS1|citation |CitationClass=book }}
  36. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  37. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  38. {{#invoke:Citation/CS1|citation |CitationClass=journal }} Reprinted in 1965 in Gesammelte Abhandlungen, vol. I by New York:Chelsea.
  39. {{#invoke:citation/CS1|citation |CitationClass=book }}
  40. 40.0 40.1 40.2 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  41. {{#invoke:citation/CS1|citation |CitationClass=book }} Reprinted by New York:Springer-Verlag in 1978.
  42. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  43. {{#invoke:citation/CS1|citation |CitationClass=book }}
  44. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  45. 45.0 45.1 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  46. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  47. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  48. {{#invoke:citation/CS1|citation |CitationClass=book }}
  49. {{#invoke:Citation/CS1|citation |CitationClass=journal }} Reprinted in 1977 in Opera matematica, vol. 4, pp. 202–205, Bucureşti:Edit. Acad. Rep. Soc. Romana.
  50. Grant, Mike, and Perella, Malcolm, "Descending to the irrational", Mathematical Gazette 83, July 1999, pp.263–267.
  51. Barbara, Roy, "Fermat's last theorem in the case n=4", Mathematical Gazette 91, July 2007, 260–262.
  52. Dolan, Stan, "Fermat's method of descente infinie", Mathematical Gazette 95, July 2011, 269–271.
  53. Ribenboim, pp. 1–2.
  54. Dickson, p. 545.
    {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  55. Euler L (1770) Vollständige Anleitung zur Algebra, Roy. Acad. Sci., St. Petersburg.
  56. Template:Cite web
  57. Ribenboim, pp. 24–25; Mordell, pp. 6–8; Edwards, pp. 39–40.
  58. Aczel, p. 44; Edwards, pp. 40, 52–54.
    {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  59. Ribenboim, pp. 33, 37–41.
  60. {{#invoke:Citation/CS1|citation |CitationClass=journal }} 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.
  61. {{#invoke:citation/CS1|citation |CitationClass=book }}
  62. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  63. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  64. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  65. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  66. {{#invoke:citation/CS1|citation |CitationClass=book }}
  67. {{#invoke:citation/CS1|citation |CitationClass=book }}
  68. 68.0 68.1 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  69. {{#invoke:Citation/CS1|citation |CitationClass=journal }} Reprinted in Selected Mathematical Papers (1977), Oslo:Universitetsforlaget, pp. 555–559.
  70. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  71. Template:Cite web
  72. Ribenboim, p. 49; Mordell, p. 8–9; Aczel, p. 44; Singh, p. 106.
  73. Ribenboim, pp. 55–57.
  74. {{#invoke:citation/CS1|citation |CitationClass=book }}
  75. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  76. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  77. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  78. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  79. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  80. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  81. Ribenboim, pp. 57–63; Mordell, p. 8; Aczel, p. 44; Singh, p. 106.
  82. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
    {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  83. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  84. Template:Cite web
  85. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
    {{#invoke:Citation/CS1|citation |CitationClass=journal }}
    {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  86. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  87. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  88. {{#invoke:Citation/CS1|citation |CitationClass=journal }} Reprinted in Selected Mathematical Papers, pp. 19–30, Oslo:Universitetsforlaget (1977).
  89. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  90. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  91. 91.0 91.1 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  92. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  93. 93.0 93.1 {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  94. {{#invoke:Citation/CS1|citation |CitationClass=journal }} Reprinted in Werke, vol. I, pp. 189–194, Berlin:G. Reimer (1889); reprinted New York:Chelsea (1969).
  95. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  96. Edwards, pp. 73–74.
  97. 97.0 97.1 Edwards, p. 74.
  98. Dickson, p. 733.
  99. {{#invoke:citation/CS1|citation |CitationClass=book }}
  100. Singh, pp. 97–109.
  101. 101.0 101.1 Template:Cite web
  102. Aczel, p. 57.
  103. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  104. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  105. Aczel, pp. 84–88; Singh, pp. 232–234.
  106. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  107. {{#invoke:citation/CS1|citation |CitationClass=book }}
  108. {{#invoke:Citation/CS1|citation |CitationClass=journal }} (PDF)
  109. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  110. 110.00 110.01 110.02 110.03 110.04 110.05 110.06 110.07 110.08 110.09 110.10 110.11 110.12 110.13 110.14 110.15 [Fermat's Last Theorem, Simon Singh, 1997, ISBN 1-85702-521-0
  111. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  112. Singh, pp. 194–198; Aczel, pp. 109–114.
  113. Singh, p. 205; Aczel, pp. 117–118.
  114. Singh, pp. 237–238; Aczel, pp. 121–122.
  115. Singh, pp. 239–243; Aczel, pp. 122–125.
  116. Singh, pp. 244–253; Aczel, pp. 1–4, 126–128.
  117. Aczel, pp. 128–130.
  118. Singh, p. 257.
  119. Singh, pp. 269–274.
  120. Singh, pp. 275–277; Aczel, pp. 132–134.
  121. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  122. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  123. Lenstra, Jr. H.W. (1992). On the inverse Fermat equation, Discrete Mathematics, 106–107, pp. 329–331.
  124. Newton, M., "A radical diophantine equation", Journal of Number Theory 13 (1981), 495–498.
  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.
  126. Dickson, pp. 688–691
  127. Voles, Roger, "Integer solutions of ," Mathematical Gazette 83, July 1999, 269–271.
  128. Richinick, Jennifer, "The upside-down Pythagorean Theorem," Mathematical Gazette 92, July 2008, 313–317.
  129. Aczel, p. 69; Singh, p. 105.
  130. Aczel, p. 69.
  131. 131.0 131.1 {{#invoke:citation/CS1|citation |CitationClass=book }}
  132. Singh, pp. 120–125, 131–133, 295–296; Aczel, p. 70.
  133. Singh, pp. 120–125.
  134. Singh, p. 284
  135. Singh, p. 295.
  136. Singh, pp. 295–296.



  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }} Template:Refend

Further reading


  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:citation/CS1|citation

|CitationClass=book }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }} Template:Refend

External links


|CitationClass=citation }}