Wikipedia

Fermat's Last Theorem

(Redirected from Fermat's conjecture)
For other theorems named after Pierre de Fermat, see Fermat's theorem. For the book by Simon Singh, see Fermat's Last Theorem (book).

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 satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions.[1]

Fermat's Last Theorem
The 1670 edition of Diophantus's Arithmetica includes Fermat's commentary, referred to as his "Last Theorem" (Observatio Domini Petri de Fermat), posthumously published by his son.
FieldNumber theory
StatementFor any integer n > 2, the equation an + bn = cn has no positive integer solutions.
First stated byPierre de Fermat
First stated inc. 1637
First proof byAndrew Wiles
First proof inReleased 1994
Published 1995
Implied by
Generalizations

The proposition was first stated as a theorem by Pierre de Fermat around 1637 in the margin of a copy of Arithmetica. Fermat added that he had a proof that was too large to fit in the margin. Although other statements claimed by Fermat without proof were subsequently proven by others and credited as theorems of Fermat (for example, Fermat's theorem on sums of two squares), Fermat's Last Theorem resisted proof, leading to doubt that Fermat ever had a correct proof. Consequently, the proposition became known as a conjecture rather than a theorem. After 358 years of effort by mathematicians, the first successful proof was released in 1994 by Andrew Wiles and formally published in 1995. It was described as a "stunning advance" in the citation for Wiles's Abel Prize award in 2016.[2] It also proved much of the Taniyama–Shimura conjecture, subsequently known as the modularity theorem, and opened up entire new approaches to numerous other problems and mathematically powerful modularity lifting techniques.

The unsolved problem stimulated the development of algebraic number theory in the 19th and 20th centuries. It is among the most notable theorems in the history of mathematics and prior to its proof was in the Guinness Book of World Records as the "most difficult mathematical problem", in part because the theorem has the largest number of unsuccessful proofs.[3]

Overview

edit

Pythagorean origins

edit

The Pythagorean equation, x2 + y2 = z2, has an infinite number of positive integer solutions for x, y, and z; these solutions are known as Pythagorean triples (with the simplest example being 3, 4, 5). Around 1637, Fermat wrote in the margin of a book 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, and none has ever been found. His claim was discovered some 30 years later, after his death. This claim, which came to be known as Fermat's Last Theorem, stood unsolved for the next three and a half centuries.[4]

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

Subsequent developments and solution

edit

The special case n = 4, proved by Fermat himself, is sufficient to establish that if the theorem is false for some exponent n that is not a prime number, it must also be false for some smaller n, so only prime values of n need further investigation.[note 1] Over the next two centuries (1637–1839), the conjecture was proved 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,[5] but a proof for all exponents was inaccessible (meaning that mathematicians generally considered a proof impossible, exceedingly difficult, or unachievable with current knowledge).[6]

Separately, 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 conjecture (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 theorem) widely considered completely inaccessible to proof.[7]

In 1984, Gerhard Frey noticed an apparent link between these two previously unrelated and unsolved problems. An outline suggesting this could be proved was given by Frey. The full proof that the two problems were closely linked was accomplished in 1986 by Ken Ribet, building on a partial proof by Jean-Pierre Serre, who proved all but one part known as the "epsilon conjecture" (see: Ribet's Theorem and Frey curve).[2] These papers by Frey, Serre and Ribet showed that if the Taniyama–Shimura conjecture could be proven for at least the semi-stable class of elliptic curves, a proof of Fermat's Last Theorem would also follow automatically. The connection is described below: any solution that could contradict Fermat's Last Theorem could also be used to contradict the Taniyama–Shimura conjecture. So if the modularity theorem were found to be true, then by definition, no solution contradicting Fermat's Last Theorem could exist, meaning that Fermat's Last Theorem must also be true.

Although both problems were daunting and widely considered to be "completely inaccessible" to proof at the time,[2] this was the first suggestion of a route by which Fermat's Last Theorem could be extended and proved for all numbers, not just some numbers. Unlike Fermat's Last Theorem, the Taniyama–Shimura conjecture was a major active research area and viewed as more within reach of contemporary mathematics.[8] However, general opinion was that this simply showed the impracticality of proving the Taniyama–Shimura conjecture.[9] Mathematician John Coates' quoted reaction was a common one:[9]

I myself was very sceptical that the beautiful link between Fermat's Last Theorem and the Taniyama–Shimura conjecture would actually lead to anything, because I must confess I did not think that the Taniyama–Shimura conjecture was accessible to proof. Beautiful though this problem was, it seemed impossible to actually prove. I must confess I thought I probably wouldn't see it proved in my lifetime.

On hearing that Ribet had proven Frey's link to be correct, English mathematician Andrew Wiles, who had a childhood fascination with Fermat's Last Theorem and had a background of working with elliptic curves and related fields, decided to try to prove the Taniyama–Shimura conjecture as a way to prove Fermat's Last Theorem. In 1993, after six years of working secretly on the problem, Wiles succeeded in proving enough of the conjecture to prove Fermat's Last Theorem. Wiles's 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 smaller joint paper showing that the fixed steps were valid. Wiles's achievement was reported widely in the popular press, and was popularized in books and television programs. The remaining parts of the Taniyama–Shimura–Weil conjecture, now proven and known as the modularity theorem, were subsequently proved by other mathematicians, who built on Wiles's work between 1996 and 2001.[10][11][12] For his proof, Wiles was honoured and received numerous awards, including the 2016 Abel Prize.[13][14][15]

Equivalent statements of the theorem

edit

There are several alternative ways to state Fermat's Last Theorem that are mathematically equivalent to the original statement of the problem.

In order to state them, we use the following notations: let N be the set of natural numbers 1, 2, 3, ..., let Z be the set of integers 0, ±1, ±2, ..., and let Q be the set of rational numbers a/b, where a and b are in Z with b ≠ 0. In what follows we will call a solution to xn + yn = zn where one or more of x, y, or z is zero a trivial solution. A solution where all three are nonzero will be called a non-trivial solution.

For comparison's sake we start with the original formulation.

  • Original statement. With n, x, y, z ∈ N (meaning that n, x, y, z are all positive whole numbers) and n > 2, the equation xn + yn = zn has no solutions.

Most popular treatments of the subject state it this way. It is also commonly stated over Z:[16]

  • Equivalent statement 1: xn + yn = zn, where integer n ≥ 3, has no non-trivial solutions x, y, z ∈ Z.

The equivalence is clear if n is even. If n is odd and all three of x, y, z are negative, then we can replace x, y, z with −x, −y, −z to obtain a solution in N. If two of them are negative, it must be x and z or y and z. If x, z are negative and y is positive, then we can rearrange to get (−z)n + yn = (−x)n resulting in a solution in N; the other case is dealt with analogously. Now if just one is negative, it must be x or y. If x is negative, and y and z are positive, then it can be rearranged to get (−x)n + zn = yn again resulting in a solution in N; if y is negative, the result follows symmetrically. Thus in all cases a nontrivial solution in Z would also mean a solution exists in N, the original formulation of the problem.

  • Equivalent statement 2: xn + yn = zn, where integer n ≥ 3, has no non-trivial solutions x, y, z ∈ Q.

This is because the exponents of x, y, and z are equal (to n), so if there is a solution in Q, then it can be multiplied through by an appropriate common denominator to get a solution in Z, and hence in N.

  • Equivalent statement 3: xn + yn = 1, where integer n ≥ 3, has no non-trivial solutions x, y ∈ Q.

A non-trivial solution a, b, c ∈ Z to xn + yn = zn yields the non-trivial solution a/c, b/c ∈ Q for vn + wn = 1. Conversely, a solution a/b, c/d ∈ Q to vn + wn = 1 yields the non-trivial solution ad, cb, bd for xn + yn = zn.

This last formulation is particularly fruitful, because it reduces the problem from a problem about surfaces in three dimensions to a problem about curves in two dimensions. Furthermore, it allows working over the field Q, rather than over the ring Z; fields exhibit more structure than rings, which allows for deeper analysis of their elements.

  • Equivalent statement 4 – connection to elliptic curves: If a, b, c is a non-trivial solution to ap + bp = cp, p odd prime, then y2 = x(x − ap)(x + bp) (Frey curve) will be an elliptic curve without a modular form.[17]

Examining this elliptic curve with Ribet's theorem shows that it does not have a modular form. However, the proof by Andrew Wiles proves that any equation of the form y2 = x(x − an)(x + bn) does have a modular form. Any non-trivial solution to xp + yp = zp (with p an odd prime) would therefore create a contradiction, which in turn proves that no non-trivial solutions exist.[18]

In other words, any solution that could contradict Fermat's Last Theorem could also be used to contradict the modularity theorem. So if the modularity theorem were found to be true, then it would follow that no contradiction to Fermat's Last Theorem could exist either. As described above, the discovery of this equivalent statement was crucial to the eventual solution of Fermat's Last Theorem, as it provided a means by which it could be "attacked" for all numbers at once.

Mathematical history

edit

Pythagoras and Diophantus

edit

Pythagorean triples

edit
Main article: Pythagorean triple

In ancient times it was known that a triangle whose sides were in the ratio 3:4:5 would have a right angle as one of its angles. This was used in construction and later in early geometry. It was also known to be one example of a general rule that any triangle where the length of two sides, each squared and then added together (32 + 42 = 9 + 16 = 25), equals the square of the length of the third side (52 = 25), would also be a right angle triangle. This is now known as the Pythagorean theorem, and a triple of numbers that meets this condition is called a Pythagorean triple; both are named after the ancient Greek Pythagoras. Examples include (3, 4, 5) and (5, 12, 13). There are infinitely many such triples,[19] and methods for generating such triples have been studied in many cultures, beginning with the Babylonians[20] and later ancient Greek, Chinese, and Indian mathematicians.[1] Mathematically, the definition of a Pythagorean triple is a set of three integers (a, b, c) that satisfy the equation[21] a2 + b2 = c2.

Diophantine equations

edit
Main article: Diophantine equation

Fermat's equation, xn + yn = zn with positive integer solutions, is an example of a Diophantine equation,[22] 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.[23] Fermat's conjecture of his Last Theorem was inspired while reading a new edition of the Arithmetica,[24] that was translated into Latin and published in 1621 by Claude Bachet.[25][26]

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

edit
 
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).[29]

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

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.[35] Although not actually a theorem at the time (meaning a mathematical statement for which proof exists), the marginal note became known over time as Fermat's Last Theorem,[30] as it was the last of Fermat's asserted theorems to remain unproved.[36][37]

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,[38] he never posed the general case.[39] Moreover, in the last thirty years of his life, Fermat never again wrote of his "truly marvelous proof" of the general case, and never published it. Van der Poorten[40] 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[41] as saying Fermat must have briefly deluded himself with an irretrievable idea. The techniques Fermat might have used in such a "marvelous proof" are unknown.

Wiles and Taylor's proof relies on 20th-century techniques.[42] Fermat's proof would have had to be 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 be 'elementary' only in a technical sense and could involve millions of steps, and thus be far too long to have been Fermat's proof.

Proofs for specific exponents

edit
Main article: Proof of Fermat's Last Theorem for specific exponents
 
Fermat's infinite descent for Fermat's Last Theorem case n=4 in the 1670 edition of the Arithmetica of Diophantus (pp. 338–339).

Exponent = 4

edit

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.[43][44][45] 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 c4 − b4 = (a2)2.

Alternative proofs of the case n = 4 were developed later[46] by Frénicle de Bessy (1676),[47] Leonhard Euler (1738),[48] Kausler (1802),[49] Peter Barlow (1811),[50] Adrien-Marie Legendre (1830),[51] Schopis (1825),[52] Olry Terquem (1846),[53] Joseph Bertrand (1851),[54] Victor Lebesgue (1853, 1859, 1862),[55] Théophile Pépin (1883),[56] Tafelmacher (1893),[57] David Hilbert (1897),[58] Bendz (1901),[59] Gambioli (1901),[60] Leopold Kronecker (1901),[61] Bang (1905),[62] Sommer (1907),[63] Bottari (1908),[64] Karel Rychlík (1910),[65] Nutzhorn (1912),[66] Robert Carmichael (1913),[67] Hancock (1931),[68] Gheorghe Vrănceanu (1966),[69] Grant and Perella (1999),[70] Barbara (2007),[71] and Dolan (2011).[72]

Other exponents

edit

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.[73] In other words, it was necessary to prove only that the equation an + bn = cn has no positive integer solutions (a, b, c) when n 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 would suffice to prove that it has no solutions for at least one prime factor of every n. Each integer n > 2 is divisible by 4 or by an odd prime number (or both). Therefore, Fermat's Last Theorem could be proved for all n if it could be proved for n = 4 and for all odd primes p.

In the two centuries following its conjecture (1637–1839), Fermat's Last Theorem was proved 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.[74][75] In 1770, Leonhard Euler gave a proof of p = 3,[76] but his proof by infinite descent[77] contained a major gap.[78][79][80] However, since Euler himself had proved the lemma necessary to complete the proof in other work, he is generally credited with the first proof.[45][81][82] Independent proofs were published[83] by Kausler (1802),[49] Legendre (1823, 1830),[51][84] Calzolari (1855),[85] Gabriel Lamé (1865),[86] Peter Guthrie Tait (1872),[87] Siegmund Günther (1878),[88] Gambioli (1901),[60] Krey (1909),[89] Rychlík (1910),[65] Stockhaus (1910),[90] Carmichael (1915),[91] Johannes van der Corput (1915),[92] Axel Thue (1917),[93] and Duarte (1944).[94]

The case p = 5 was proved[95] independently by Legendre and Peter Gustav Lejeune Dirichlet around 1825.[96][97][45][98] Alternative proofs were developed[99] by Carl Friedrich Gauss (1875, posthumous),[100] Lebesgue (1843),[101] Lamé (1847),[102] Gambioli (1901),[60][103] Werebrusow (1905),[104][full citation needed] Rychlík (1910),[105][dubious – discuss][full citation needed] van der Corput (1915),[92] and Guy Terjanian (1987).[106]

The case p = 7 was proved[107][108][45][98] by Lamé in 1839.[109] His rather complicated proof was simplified in 1840 by Lebesgue,[110] and still simpler proofs[111] were published by Angelo Genocchi in 1864, 1874 and 1876.[112] Alternative proofs were developed by Théophile Pépin (1876)[113] and Edmond Maillet (1897).[114]

Fermat's Last Theorem was also proved for the exponents n = 6, 10, and 14. Proofs for n = 6 were published by Kausler,[49] Thue,[115] Tafelmacher,[116] Lind,[117] Kapferer,[118] Swift,[119] and Breusch.[120] Similarly, Dirichlet[121] and Terjanian[122] each proved the case n = 14, while Kapferer[118] and Breusch[120] 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.[123]

All proofs for specific exponents used Fermat's technique of infinite descent,[citation needed] either in its original form, or in the form of descent on elliptic curves or abelian varieties. The details and auxiliary arguments, however, were often ad hoc and tied to the individual exponent under consideration.[124] Since they became ever more complicated as p increased, it seemed unlikely that the general case of Fermat's Last Theorem could be proved by building upon the proofs for individual exponents.[124] Although some general results on Fermat's Last Theorem were published in the early 19th century by Niels Henrik Abel and Peter Barlow,[125][126] the first significant work on the general theorem was done by Sophie Germain.[127]

Early modern breakthroughs

edit

Sophie Germain

edit

In the early 19th century, Sophie Germain developed several novel approaches to prove Fermat's Last Theorem for all exponents.[128] 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 270,[128][129] and for all primes p such that at least one of 2p + 1, 4p + 1, 8p + 1, 10p + 1, 14p + 1 and 16p + 1 is prime (specially, the primes p such that 2p + 1 is prime are called Sophie Germain primes). Germain tried unsuccessfully to prove the first case of Fermat's Last Theorem for all even exponents, specifically for n = 2p, which was proved by Guy Terjanian in 1977.[130] 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.[131]

Ernst Kummer and the theory of ideals

edit

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.

(It is often stated that Kummer was led to his "ideal complex numbers" by his interest in Fermat's Last Theorem; there is even a story often told that Kummer, like Lamé, believed he had proven Fermat's Last Theorem until Lejeune Dirichlet told him his argument relied on unique factorization; but the story was first told by Kurt Hensel in 1910 and the evidence indicates it likely derives from a confusion by one of Hensel's sources. Harold Edwards said the belief that Kummer was mainly interested in Fermat's Last Theorem "is surely mistaken".[132] See the history of 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 270 are 37, 59, 67, 101, 103, 131, 149, 157, 233, 257 and 263.

Mordell conjecture

edit

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.[133][134] This conjecture was proved in 1983 by Gerd Faltings,[135] and is now known as Faltings's theorem.

Computational studies

edit

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

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, such as with Skewes' number, and it could not be ruled out in this conjecture.)

Connection with elliptic curves

edit

The strategy that ultimately led to a successful proof of Fermat's Last Theorem arose from the "astounding"[138]: 211  Taniyama–Shimura–Weil conjecture, proposed around 1955—which many mathematicians believed would be near to impossible to prove,[138]: 223  and 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 known as the modularity theorem.

Taniyama–Shimura–Weil conjecture

edit
Main article: Modularity theorem

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.

The link was initially dismissed as unlikely or highly speculative, but was taken more seriously when number theorist André Weil found evidence supporting it, though not proving it; as a result the conjecture was often known as the Taniyama–Shimura–Weil conjecture.[138]: 211–215 

Even after gaining serious attention, the conjecture was seen by contemporary mathematicians as extraordinarily difficult or perhaps inaccessible to proof.[138]: 203–205, 223, 226  For example, Wiles's doctoral supervisor John Coates states that it seemed "impossible to actually prove",[138]: 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]."[138]: 223 

Ribet's theorem for Frey curves

edit
Main articles: Frey curve and Ribet's theorem

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 semi-stable elliptic curve (now known as a Frey-Hellegouarch[note 3])

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

would have such unusual properties that it was unlikely to be modular.[139] 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 might also simultaneously prove Fermat's Last Theorem.[140][141] By contraposition, a disproof or refutation of Fermat's Last Theorem would disprove the Taniyama–Shimura–Weil conjecture.

In plain English, Frey had shown that, if this intuition about his equation was correct, then any set of four numbers (a, b, c, n) capable of disproving Fermat's Last Theorem, could also be used to disprove the Taniyama–Shimura–Weil conjecture. Therefore, if the latter were true, the former could not be disproven, and would also have to be true.

Following this strategy, a proof of Fermat's Last Theorem required two steps. First, it was necessary to prove the modularity theorem, or at least to prove it for the types of elliptical curves that included Frey's equation (known as semistable elliptic curves). This was widely believed inaccessible to proof by contemporary mathematicians.[138]: 203–205, 223, 226  Second, 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 showed that this was plausible but did not go as far as giving a full proof. The missing piece (the so-called "epsilon conjecture", now known as Ribet's theorem) was identified by Jean-Pierre Serre who also gave an almost-complete proof and the link suggested by Frey was finally proved in 1986 by Ken Ribet.[142]

Following Frey, Serre and Ribet's work, this was where matters stood:

  • Fermat's Last Theorem needed to be proven for all exponents n that were prime numbers.
  • The modularity theorem—if proved for semi-stable elliptic curves—would mean that all semistable elliptic curves must be modular.
  • Ribet's theorem showed that any solution to Fermat's equation for a prime number could be used to create a semistable elliptic curve that could not be modular;
  • The only way that both of these statements could be true, was if no solutions existed to Fermat's equation (because then no such curve could be created), which was what Fermat's Last Theorem said. As Ribet's Theorem was already proved, this meant that a proof of the modularity theorem would automatically prove Fermat's Last theorem was true as well.

Wiles's general proof

edit
 
British mathematician Andrew Wiles
Main articles: Andrew Wiles and Wiles's proof of Fermat's Last Theorem

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 who had worked on elliptic curves, 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.[143][144]

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.[138]: 229–230  His initial study suggested proof by induction,[138]: 230–232, 249–252  and he based his initial work and first significant breakthrough on Galois theory[138]: 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.[138]: 258–259  However, by mid-1991, Iwasawa theory also seemed to not be reaching the central issues in the problem.[138]: 259–260 [145][146] 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.[138]: 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 help him check his reasoning for subtle errors. Their conclusion at the time was that the techniques Wiles used seemed to work correctly.[138]: 261–265 [147][148]

By mid-May 1993, Wiles was ready to tell his wife he thought he had solved the proof of Fermat's Last Theorem,[138]: 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.[149][150] 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),[151] who alerted Wiles on 23 August 1993.[152]

The error would not have rendered his work worthless: each part of Wiles's 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.[138]: 289, 296–297  However, without this part proved, 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 his former student Richard Taylor, without success.[153][154][155] By the end of 1993, rumours had spread that under scrutiny, Wiles's proof had failed, but how seriously was not known. Mathematicians were beginning to pressure Wiles to disclose his work whether it was complete or not, so that the wider community could explore and use whatever he had managed to accomplish. But instead of being fixed, the problem, which had originally seemed minor, now seemed very significant, far more serious, and less easy to resolve.[156]

Wiles states that on the morning of 19 September 1994, he was on the verge of giving up and was almost resigned to accepting that he had failed, and to publishing his work so that others could build on it and fix the error. He adds that he was having a final look to try and understand the fundamental reasons why his approach could not be made to work, when he had a sudden insight: that the specific reason why the Kolyvagin–Flach approach would not work directly also meant that his original attempts using Iwasawa theory could be made to work, if he strengthened it using his experience gained from the Kolyvagin–Flach approach. Fixing one approach with tools from the other approach would resolve the issue for all the cases that were not already proven by his refereed paper.[153][157] He described later that Iwasawa theory and the Kolyvagin–Flach approach were each inadequate on their own, but together they could be made powerful enough to overcome this final hurdle.[153]

I was sitting at my desk examining the Kolyvagin–Flach method. It wasn't that I believed I could make it work, but I thought that at least I could explain why it didn't work. Suddenly I had this incredible revelation. I realised that, the Kolyvagin–Flach method wasn't working, but it was all I needed to make my original Iwasawa theory work from three years earlier. So out of the ashes of Kolyvagin–Flach seemed to rise the true answer to the problem. It was so indescribably beautiful; it was so simple and so elegant. I couldn't understand how I'd missed it and I just stared at it in disbelief for twenty minutes. Then during the day I walked around the department, and I'd keep coming back to my desk looking to see if it was still there. It was still there. I couldn't contain myself, I was so excited. It was the most important moment of my working life. Nothing I ever do again will mean as much.

— Andrew Wiles, as quoted by Simon Singh[158]

On 24 October 1994, Wiles submitted two manuscripts, "Modular elliptic curves and Fermat's Last Theorem"[159][160] and "Ring theoretic properties of certain Hecke algebras",[161] 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. The proof's method of identification of a deformation ring with a Hecke algebra (now referred to as an R=T theorem) to prove modularity lifting theorems has been an influential development in algebraic number theory.

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

edit

The full Taniyama–Shimura–Weil conjecture was finally proved by Diamond (1996),[10] Conrad et al. (1999),[11] and Breuil et al. (2001)[12] who, building on Wiles's 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 nth powers, n ≥ 3. (The case n = 3 was already known by Euler.)

Relationship to other problems and generalizations

edit

Fermat's Last Theorem considers solutions to the Fermat equation: an + bn = cn with positive integers a, b, and c and an integer n greater than 2. There are several generalizations of the Fermat equation to more general equations that allow the exponent n to be a negative integer or rational, or to consider three different exponents.

Generalized Fermat equation

edit

The generalized Fermat equation generalizes the statement of Fermat's last theorem by considering positive integer solutions a, b, c, m, n, k satisfying[162]

  (1)

In particular, the exponents m, n, k need not be equal, whereas Fermat's last theorem considers the case m = n = k.

The Beal conjecture, also known as the Mauldin conjecture[163] and the Tijdeman-Zagier conjecture,[164][165][166] states that there are no solutions to the generalized Fermat equation in positive integers a, b, c, m, n, k with a, b, and c being pairwise coprime and all of m, n, k being greater than 2.[167]

The Fermat–Catalan conjecture generalizes Fermat's last theorem with the ideas of the Catalan conjecture.[168][169] The conjecture states that the generalized Fermat equation has only finitely many solutions (a, b, c, m, n, k) with distinct triplets of values (am, bn, ck), where a, b, c are positive coprime integers and m, n, k are positive integers satisfying

  (2)

The statement is about the finiteness of the set of solutions because there are 10 known solutions.[162]

Inverse Fermat equation

edit

When we allow the exponent n to be the reciprocal of an integer, i.e. n = 1/m for some integer m, we have the inverse Fermat equation a1/m + b1/m = c1/m. All solutions of this equation were computed by Hendrik Lenstra in 1992.[170] In the case in which the mth roots are required to be real and positive, all solutions are given by[171]

 
 
 

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

Rational exponents

edit

For the Diophantine equation an/m + bn/m = cn/m with n not equal to 1, Bennett, Glass, and Székely proved in 2004 for n > 2, that if n and m are coprime, 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.[172]

Negative integer exponents

edit

n = −1

edit

All primitive integer solutions (i.e., those with no prime factor common to all of a, b, and c) to the optic equation a−1 + b−1 = c−1 can be written as[173]

 
 
 

for positive, coprime integers m, k.

n = −2

edit

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.[174][175] All primitive solutions to a−2 + b−2 = d−2 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.

n < −2

edit

There are no solutions in integers for an + bn = cn for integers n < −2. If there were, the equation could be multiplied through by a|n|b|n|c|n| to obtain (bc)|n| + (ac)|n| = (ab)|n|, which is impossible by Fermat's Last Theorem.

abc conjecture

edit
Main article: abc conjecture § Some consequences

The abc conjecture roughly states that if three positive integers a, b and c (hence the name) are coprime and satisfy a + b = c, then the radical d of abc is usually not much smaller than c. In particular, the abc conjecture in its most standard formulation implies Fermat's last theorem for n that are sufficiently large.[176][177][178] The modified Szpiro conjecture is equivalent to the abc conjecture and therefore has the same implication.[179][178] An effective version of the abc conjecture, or an effective version of the modified Szpiro conjecture, implies Fermat's Last Theorem outright.[178]

Prizes and incorrect proofs

edit

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

In 1908, the German industrialist and amateur mathematician Paul Wolfskehl bequeathed 100,000 gold marks—a large sum at the time—to the Göttingen Academy of Sciences to offer as a prize for a complete proof of Fermat's Last Theorem.[183][184] 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.[185] Wiles collected the Wolfskehl prize money, then worth $50,000, on 27 June 1997.[186] In March 2016, Wiles was awarded the Norwegian government's Abel prize worth €600,000 for "his stunning proof of Fermat's Last Theorem by way of the modularity conjecture for semistable elliptic curves, opening a new era in number theory".[187]

Prior to Wiles's proof, thousands of incorrect proofs were submitted to the Wolfskehl committee, amounting to roughly 10 feet (3.0 meters) of correspondence.[188] 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 some claims, Edmund Landau tended to use a special preprinted form for such proofs, where the location of the first mistake was left blank to be filled by one of his graduate students.[189] 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".[190] 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."[182]

edit
Main article: Fermat's Last Theorem in fiction

The popularity of the theorem outside science has led to it being described as achieving "that rarest of mathematical accolades: A niche role in pop culture."[191]

 
Czech postage stamp commemorating Wiles' proof

Arthur Porges' 1954 short story "The Devil and Simon Flagg" features a mathematician who bargains with the Devil that the latter cannot produce a proof of Fermat's Last Theorem within twenty-four hours.[192]

In The Simpsons episode "The Wizard of Evergreen Terrace", Homer Simpson writes the equation 398712 + 436512 = 447212 on a blackboard, which appears to be a counterexample to Fermat's Last Theorem. The equation is wrong, but it appears to be correct if entered in a calculator with 10 significant figures.[193]

In the Star Trek: The Next Generation episode "The Royale", Captain Picard states that the theorem is still unproven in the 24th century. The proof was released 5 years after the episode originally aired.[194]

See also

edit

Footnotes

edit
  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 = PQ), in which P is a prime number greater than 2, and then an = aPQ = (aQ)P for each of a, b, and c. That is, an equivalent solution would also have to exist for the prime power P that is smaller than n; or else as n would be a power of 2 greater than 4, and writing n = 4Q, the same argument would hold.
  2. ^ For example, ((jr + 1)s)r + (j(jr + 1)s)r = (jr + 1)rs+1.
  3. ^ This elliptic curve was first suggested in the 1960s by Yves Hellegouarch [de], 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-0-12-339251-0.

References

edit
  1. ^ a b Singh, pp. 18–20
  2. ^ a b c "Abel prize 2016 – full citation". Archived from the original on 20 May 2020. Retrieved 16 March 2016.
  3. ^ "Science and Technology". The Guinness Book of World Records. Guinness Publishing Ltd. 1995. ISBN 9780965238304.
  4. ^ Nigel Boston. "The Proof of Fermat's Last Theorem" (PDF). p. 5.
  5. ^ a b Buhler J, Crandell R, Ernvall R, Metsänkylä T (1993). "Irregular primes and cyclotomic invariants to four million". Mathematics of Computation. 61 (203). American Mathematical Society: 151–153. Bibcode:1993MaCom..61..151B. doi:10.2307/2152942. JSTOR 2152942.
  6. ^ Singh, p. 223
  7. ^ Singh 1997, pp. 203–205, 223, 226
  8. ^ Singh, p. 144 quotes Wiles's reaction to this news: "I was electrified. I knew that moment that the course of my life was changing because this meant that to prove Fermat's Last Theorem all I had to do was to prove the Taniyama–Shimura conjecture. It meant that my childhood dream was now a respectable thing to work on."
  9. ^ a b Singh, p. 144
  10. ^ a b Diamond, Fred (July 1996). "On Deformation Rings and Hecke Rings". The Annals of Mathematics. 144 (1): 137–166. doi:10.2307/2118586. JSTOR 2118586.
  11. ^ a b Conrad, Brian; Diamond, Fred; Taylor, Richard (1999). "Modularity of certain potentially Barsotti-Tate Galois representations". Journal of the American Mathematical Society. 12 (2): 521–567. doi:10.1090/S0894-0347-99-00287-8. ISSN 0894-0347.
  12. ^ a b Breuil, Christophe; Conrad, Brian; Diamond, Fred; Taylor, Richard (15 May 2001). "On the modularity of elliptic curves over Q: Wild 3-adic exercises". Journal of the American Mathematical Society. 14 (4): 843–939. doi:10.1090/S0894-0347-01-00370-8. ISSN 0894-0347.
  13. ^ Castelvecchi, Davide (15 March 2016). "Fermat's last theorem earns Andrew Wiles the Abel Prize". Nature. 531 (7594): 287. Bibcode:2016Natur.531..287C. doi:10.1038/nature.2016.19552. PMID 26983518. S2CID 4383161.
  14. ^ British mathematician Sir Andrew Wiles gets Abel math prize – The Washington Post.
  15. ^ 300-year-old math question solved, professor wins $700k – CNN.com.
  16. ^ Weisstein, Eric W. "Fermat's Last Theorem". MathWorld – A Wolfram Web Resource. Retrieved 7 May 2021.
  17. ^ Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem" (PDF). Annals of Mathematics. 141 (3): 448. doi:10.2307/2118559. JSTOR 2118559. OCLC 37032255. Archived from the original (PDF) on 10 May 2011. Retrieved 11 August 2003. Frey's suggestion, in the notation of the following theorem, was to show that the (hypothetical) elliptic curve y2 = x(x + up)(x – vp) could not be modular.
  18. ^ Ribet, Ken (1990). "On modular representations of Gal(Q/Q) arising from modular forms" (PDF). Inventiones Mathematicae. 100 (2): 432. Bibcode:1990InMat.100..431R. doi:10.1007/BF01231195. hdl:10338.dmlcz/147454. MR 1047143. S2CID 120614740.
  19. ^ Stillwell J (2003). Elements of Number Theory. New York: Springer-Verlag. pp. 110–112. ISBN 0-387-95587-9. Retrieved 17 March 2016.
  20. ^ Aczel 1996, pp. 13–15
  21. ^ Stark 1978, pp. 151–155
  22. ^ Stark 1978, pp. 145–146
  23. ^ Singh, pp. 50–51
  24. ^ Stark 1978, p. 145
  25. ^ Aczel 1996, pp. 44–45
  26. ^ Singh, pp. 56–58
  27. ^ Aczel 1996, pp. 14–15
  28. ^ Stark 1978, pp. 44–47
  29. ^ Friberg 2007, pp. 333–334
  30. ^ a b Dickson 1919, p. 731
  31. ^ Singh, pp. 60–62
  32. ^ Aczel 1996, p. 9
  33. ^ T. Heath, Diophantus of Alexandria Second Edition, Cambridge University Press, 1910, reprinted by Dover, NY, 1964, pp. 144–145
  34. ^ Manin & Panchishkin 2007, p. 341
  35. ^ Singh, pp. 62–66
  36. ^ Singh, p. 67
  37. ^ Aczel 1996, p. 10
  38. ^ Ribenboim, pp. 13, 24
  39. ^ van der Poorten, Notes and Remarks 1.2, p. 5
  40. ^ van der Poorten, loc. cit.
  41. ^ André Weil (1984). Number Theory: An approach through history. From Hammurapi to Legendre. Basel, Switzerland: Birkhäuser. p. 104.
  42. ^ BBC Documentary.[dead YouTube link]
  43. ^ Freeman L (12 May 2005). "Fermat's One Proof". Retrieved 23 May 2009.
  44. ^ Dickson 1919, pp. 615–616
  45. ^ a b c d Aczel 1996, p. 44
  46. ^ Ribenboim, pp. 15–24
  47. ^ 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)
  48. ^ Euler L (1738). "Theorematum quorundam arithmeticorum demonstrationes". Novi Commentarii Academiae Scientiarum Petropolitanae. 10: 125–146.. Reprinted Opera omnia, ser. I, "Commentationes Arithmeticae", vol. I, pp. 38–58, Leipzig:Teubner (1915)
  49. ^ a b c Kausler CF (1802). "Nova demonstratio theorematis nec summam, nec differentiam duorum cuborum cubum esse posse". Novi Acta Academiae Scientiarum Imperialis Petropolitanae. 13: 245–253.
  50. ^ Barlow P (1811). An Elementary Investigation of Theory of Numbers. St. Paul's Church-Yard, London: J. Johnson. pp. 144–145.
  51. ^ 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).
  52. ^ Schopis (1825). Einige Sätze aus der unbestimmten Analytik. Gummbinnen: Programm.
  53. ^ Terquem O (1846). "Théorèmes sur les puissances des nombres". Nouvelles Annales de Mathématiques. 5: 70–87.
  54. ^ Bertrand J (1851). Traité Élémentaire d'Algèbre. Paris: Hachette. pp. 217–230, 395.
  55. ^ Lebesgue VA (1853). "Résolution des équations biquadratiques z2 = x4 ± 2my4, z2 = 2mx4 − y4, 2mz2 = x4 ± y4". Journal de Mathématiques Pures et Appliquées. 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.
  56. ^ Pepin T (1883). "Étude sur l'équation indéterminée ax4 + by4 = cz2". Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Serie IX. Matematica e Applicazioni. 36: 34–70.
  57. ^ A. Tafelmacher (1893). "Sobre la ecuación x4 + y4 = z4". Anales de la Universidad de Chile. 84: 307–320.
  58. ^ Hilbert D (1897). "Die Theorie der algebraischen Zahlkörper". Jahresbericht der Deutschen Mathematiker-Vereinigung. 4: 175–546. Reprinted in 1965 in Gesammelte Abhandlungen, vol. I by New York:Chelsea.
  59. ^ Bendz TR (1901). Öfver diophantiska ekvationen xn + yn = zn (Thesis). Uppsala: Almqvist & Wiksells Boktrycken.
  60. ^ a b c Gambioli D (1901). "Memoria bibliographica sull'ultimo teorema di Fermat". Periodico di Matematiche. 16: 145–192.
  61. ^ Kronecker L (1901). Vorlesungen über Zahlentheorie, vol. I. Leipzig: Teubner. pp. 35–38. Reprinted by New York:Springer-Verlag in 1978.
  62. ^ Bang A (1905). "Nyt Bevis for at Ligningen x4 − y4 = z4, ikke kan have rationale Løsinger". Nyt Tidsskrift for Matematik. 16B: 31–35. JSTOR 24528323.
  63. ^ Sommer J (1907). Vorlesungen über Zahlentheorie. Leipzig: Teubner.
  64. ^ Bottari A (1908). "Soluzione intere dell'equazione pitagorica e applicazione alla dimostrazione di alcune teoremi della teoria dei numeri". Periodico di Matematiche. 23: 104–110.
  65. ^ a b Rychlik K (1910). "On Fermat's last theorem for n = 4 and n = 3 (in Bohemian)". Časopis Pro Pěstování Matematiky a Fysiky. 39: 65–86.
  66. ^ Nutzhorn F (1912). "Den ubestemte Ligning x4 + y4 = z4". Nyt Tidsskrift for Matematik. 23B: 33–38.
  67. ^ Carmichael RD (1913). "On the impossibility of certain Diophantine equations and systems of equations". American Mathematical Monthly. 20 (7). Mathematical Association of America: 213–221. doi:10.2307/2974106. JSTOR 2974106.
  68. ^ Hancock H (1931). Foundations of the Theory of Algebraic Numbers, vol. I. New York: Macmillan.
  69. ^ Gheorghe Vrănceanu (1966). "Asupra teorema lui Fermat pentru n = 4". Gazeta Matematică Seria A. 71: 334–335. Reprinted in 1977 in Opera matematica, vol. 4, pp. 202–205, București: Editura Academiei Republicii Socialiste România.
  70. ^ Grant, Mike, and Perella, Malcolm, "Descending to the irrational", Mathematical Gazette 83, July 1999, pp. 263–267.
  71. ^ Barbara, Roy, "Fermat's last theorem in the case n = 4", Mathematical Gazette 91, July 2007, 260–262.
  72. ^ Dolan, Stan, "Fermat's method of descente infinie", Mathematical Gazette 95, July 2011, 269–271.
  73. ^ Ribenboim, pp. 1–2
  74. ^ Dickson 1919, p. 545
  75. ^ O'Connor, John J.; Robertson, Edmund F. "Abu Mahmud Hamid ibn al-Khidr Al-Khujandi". MacTutor History of Mathematics Archive. University of St Andrews.
  76. ^ Euler L (1770) Vollständige Anleitung zur Algebra, Roy. Acad. Sci., St. Petersburg.
  77. ^ Freeman L (22 May 2005). "Fermat's Last Theorem: Proof for n = 3". Retrieved 23 May 2009.
  78. ^ Ribenboim, pp. 24–25
  79. ^ Mordell 1921, pp. 6–8
  80. ^ Edwards 1996, pp. 39–40
  81. ^ Edwards 1996, pp. 40, 52–54
  82. ^ J. J. Mačys (2007). "On Euler's hypothetical proof". Mathematical Notes. 82 (3–4): 352–356. doi:10.1134/S0001434607090088. MR 2364600. S2CID 121798358.
  83. ^ Ribenboim, pp. 33, 37–41
  84. ^ Legendre AM (1823). "Recherches sur quelques objets d'analyse indéterminée, et particulièrement sur le théorème de Fermat". Mémoires de l'Académie royale des sciences. 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.
  85. ^ Calzolari L (1855). Tentativo per dimostrare il teorema di Fermat sull'equazione indeterminata xn + yn = zn. Ferrara.
  86. ^ Lamé G (1865). "Étude des binômes cubiques x3 ± y3". Comptes rendus hebdomadaires des séances de l'Académie des Sciences. 61: 921–924, 961–965.
  87. ^ Tait PG (1872). "Mathematical Notes". Proceedings of the Royal Society of Edinburgh. 7: 144. doi:10.1017/s0370164600041857.
  88. ^ Günther, S. (1878). "Ueber die unbestimmte Gleichung x3 + y3 = a3". Sitzungsberichte der Königliche böhmische Gesellschaft der Wissenschaften in Prag. jahrg. 1878-1880: 112–120.
  89. ^ Krey, H. (1909). "Neuer Beweis eines arithmetischen Satzes". Mathematisch-Naturwissenschaftliche Blätter. 6 (12): 179–180.
  90. ^ Stockhaus H (1910). Beitrag zum Beweis des Fermatschen Satzes. Leipzig: Brandstetter.
  91. ^ Carmichael RD (1915). Diophantine Analysis. New York: Wiley.
  92. ^ a b van der Corput JG (1915). "Quelques formes quadratiques et quelques équations indéterminées". Nieuw Archief voor Wiskunde. 11: 45–75.
  93. ^ Thue, Axel (1917). "Et bevis for at ligningen A3 + B3 = C3 er unmulig i hele tal fra nul forskjellige tal A, B og C". Archiv for Mathematik og Naturvidenskab. 34 (15): 3–7. Reprinted in Selected Mathematical Papers (1977), Oslo: Universitetsforlaget, pp. 555–559
  94. ^ Duarte FJ (1944). "Sobre la ecuación x3 + y3 + z3 = 0". Boletín de la Academia de Ciencias Físicas, Matemáticas y Naturales (Caracas). 8: 971–979.
  95. ^ Freeman L (28 October 2005). "Fermat's Last Theorem: Proof for n = 5". Retrieved 23 May 2009.
  96. ^ Ribenboim, p. 49
  97. ^ Mordell 1921, pp. 8–9
  98. ^ a b Singh, p. 106
  99. ^ Ribenboim, pp. 55–57
  100. ^ Gauss CF (1875). "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. (Published posthumously)
  101. ^ Lebesgue VA (1843). "Théorèmes nouveaux sur l'équation indéterminée x5 + y5 = az5". Journal de Mathématiques Pures et Appliquées. 8: 49–70.
  102. ^ Lamé G (1847). "Mémoire sur la résolution en nombres complexes de l'équation A5 + B5 + C5 = 0". Journal de Mathématiques Pures et Appliquées. 12: 137–171.
  103. ^ Gambioli D (1903–1904). "Intorno all'ultimo teorema di Fermat". Il Pitagora. 10: 11–13, 41–42.
  104. ^ Werebrusow AS (1905). "On the equation x5 + y5 = Az5 (in Russian)". Moskov. Math. Samml. 25: 466–473.
  105. ^ Rychlik K (1910). "On Fermat's last theorem for n = 5 (in Bohemian)". Časopis Pěst. Mat. 39: 185–195, 305–317.
  106. ^ Terjanian G (1987). "Sur une question de V. A. Lebesgue". Annales de l'Institut Fourier. 37 (3): 19–37. doi:10.5802/aif.1096.
  107. ^ Ribenboim, pp. 57–63
  108. ^ Mordell 1921, p. 8
  109. ^ Lamé G (1839). "Mémoire sur le dernier théorème de Fermat". Comptes rendus hebdomadaires des séances de l'Académie des Sciences. 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". Journal de Mathématiques Pures et Appliquées. 5: 195–211.
  110. ^ Lebesgue VA (1840). "Démonstration de l'impossibilité de résoudre l'équation x7 + y7 + z7 = 0 en nombres entiers". Journal de Mathématiques Pures et Appliquées. 5: 276–279, 348–349.
  111. ^ Freeman L (18 January 2006). "Fermat's Last Theorem: Proof for n = 7". Retrieved 23 May 2009.
  112. ^ Genocchi A (1864). "Intorno all'equazioni x7 + y7 + z7 = 0". Annali di Matematica Pura ed Applicata. 6: 287–288. doi:10.1007/bf03198884. S2CID 124916552.
    Genocchi A (1874). "Sur l'impossibilité de quelques égalités doubles". Comptes rendus hebdomadaires des séances de l'Académie des Sciences. 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". Comptes rendus hebdomadaires des séances de l'Académie des Sciences. 82: 910–913.
  113. ^ Pepin T (1876). "Impossibilité de l'équation x7 + y7 + z7 = 0". Comptes rendus hebdomadaires des séances de l'Académie des Sciences. 82: 676–679, 743–747.
  114. ^ Maillet E (1897). "Sur l'équation indéterminée axλt + byλt = czλt". Association française pour l'avancement des sciences, St. Etienne, Compte Rendu de la 26me Session, deuxième partie. 26: 156–168.
  115. ^ Thue A (1896). "Über die Auflösbarkeit einiger unbestimmter Gleichungen". Det Kongelige Norske Videnskabers Selskabs Skrifter. 7. Reprinted in Selected Mathematical Papers, pp. 19–30, Oslo: Universitetsforlaget (1977).
  116. ^ Tafelmacher WLA (1897). "La ecuación x3 + y3 = z2: Una demonstración nueva del teorema de fermat para el caso de las sestas potencias". Anales de la Universidad de Chile. 97: 63–80.
  117. ^ Lind B (1909). "Einige zahlentheoretische Sätze". Archiv der Mathematik und Physik. 15: 368–369.
  118. ^ a b Kapferer H (1913). "Beweis des Fermatschen Satzes für die Exponenten 6 und 10". Archiv der Mathematik und Physik. 21: 143–146.
  119. ^ Swift E (1914). "Solution to Problem 206". American Mathematical Monthly. 21 (7): 238–239. doi:10.2307/2972379. JSTOR 2972379.
  120. ^ a b Breusch R (1960). "A simple proof of Fermat's last theorem for n = 6, n = 10". Mathematics Magazine. 33 (5): 279–281. doi:10.2307/3029800. JSTOR 3029800.
  121. ^ Dirichlet PGL (1832). "Démonstration du théorème de Fermat pour le cas des 14e puissances". Journal für die reine und angewandte Mathematik. 9: 390–393. Reprinted in Werke, vol. I, pp. 189–194, Berlin: G. Reimer (1889); reprinted New York:Chelsea (1969).
  122. ^ Terjanian G (1974). "L'équation x14 + y14 = z14 en nombres entiers". Bulletin des Sciences Mathématiques. Série 2. 98: 91–95.
  123. ^ Edwards 1996, pp. 73–74
  124. ^ a b Edwards 1996, p. 74
  125. ^ Dickson 1919, p. 733
  126. ^ Ribenboim P (1979). 13 Lectures on Fermat's Last Theorem. New York: Springer Verlag. pp. 51–54. ISBN 978-0-387-90432-0.
  127. ^ Singh, pp. 97–109
  128. ^ a b Laubenbacher R, Pengelley D (2007). "Voici ce que j'ai trouvé: Sophie Germain's grand plan to prove Fermat's Last Theorem" (PDF). Archived from the original (PDF) on 5 April 2013. Retrieved 19 May 2009.
  129. ^ Aczel 1996, p. 57
  130. ^ Terjanian, G. (1977). "Sur l'équation x2p + y2p = z2p". Comptes Rendus de l'Académie des Sciences, Série A-B. 285: 973–975.
  131. ^ Adleman LM, Heath-Brown DR (June 1985). "The first case of Fermat's last theorem". Inventiones Mathematicae. 79 (2). Berlin: Springer: 409–416. Bibcode:1985InMat..79..409A. doi:10.1007/BF01388981. S2CID 122537472.
  132. ^ Edwards 1996, p. 79
  133. ^ Aczel 1996, pp. 84–88
  134. ^ Singh, pp. 232–234
  135. ^ Faltings G (1983). "Endlichkeitssätze für abelsche Varietäten über Zahlkörpern". Inventiones Mathematicae. 73 (3): 349–366. Bibcode:1983InMat..73..349F. doi:10.1007/BF01388432. S2CID 121049418.
  136. ^ Ribenboim P (1979). 13 Lectures on Fermat's Last Theorem. New York: Springer Verlag. p. 202. ISBN 978-0-387-90432-0.
  137. ^ Wagstaff SS Jr. (1978). "The irregular primes to 125000". Mathematics of Computation. 32 (142). American Mathematical Society: 583–591. doi:10.2307/2006167. JSTOR 2006167. (PDF) Archived 24 October 2012 at the Wayback Machine
  138. ^ a b c d e f g h i j k l m n o p Fermat's Last Theorem, Simon Singh, 1997, ISBN 1-85702-521-0
  139. ^ Frey G (1986). "Links between stable elliptic curves and certain diophantine equations". Annales Universitatis Saraviensis. Series Mathematicae. 1: 1–40.
  140. ^ Singh, pp. 194–198
  141. ^ Aczel 1996, pp. 109–114
  142. ^ Ribet, Ken (1990). "On modular representations of Gal(Q/Q) arising from modular forms" (PDF). Inventiones Mathematicae. 100 (2): 431–476. Bibcode:1990InMat.100..431R. doi:10.1007/BF01231195. hdl:10338.dmlcz/147454. MR 1047143. S2CID 120614740.
  143. ^ Singh, p. 205
  144. ^ Aczel 1996, pp. 117–118
  145. ^ Singh, pp. 237–238
  146. ^ Aczel 1996, pp. 121–122
  147. ^ Singh, pp. 239–243
  148. ^ Aczel 1996, pp. 122–125
  149. ^ Singh, pp. 244–253
  150. ^ Aczel 1996, pp. 1–4, 126–128
  151. ^ Aczel 1996, pp. 128–130
  152. ^ Singh, p. 257
  153. ^ a b c Singh, pp. 269–277
  154. ^ A Year Later, Snag Persists In Math Proof 28 June 1994
  155. ^ 26 June – 2 July; A Year Later Fermat's Puzzle Is Still Not Quite Q.E.D. 3 July 1994
  156. ^ Singh, pp. 175–185
  157. ^ Aczel 1996, pp. 132–134
  158. ^ Singh p. 186–187 (text condensed)
  159. ^ Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem" (PDF). Annals of Mathematics. 141 (3): 443–551. doi:10.2307/2118559. JSTOR 2118559. OCLC 37032255. Archived from the original (PDF) on 28 June 2003.
  160. ^ "Modular elliptic curves and Fermat's Last Theorem" (PDF).
  161. ^ Taylor R, Wiles A (1995). "Ring theoretic properties of certain Hecke algebras". Annals of Mathematics. 141 (3): 553–572. doi:10.2307/2118560. JSTOR 2118560. OCLC 37032255. Archived from the original on 27 November 2001.
  162. ^ a b Barrow-Green, June; Leader, Imre; Gowers, Timothy (2008). The Princeton Companion to Mathematics. Princeton University Press. pp. 361–362. ISBN 9781400830398.
  163. ^ "Mauldin / Tijdeman-Zagier Conjecture". Prime Puzzles. Retrieved 1 October 2016.
  164. ^ Elkies, Noam D. (2007). "The ABC's of Number Theory" (PDF). The Harvard College Mathematics Review. 1 (1).
  165. ^ Michel Waldschmidt (2004). "Open Diophantine Problems". Moscow Mathematical Journal. 4: 245–305. arXiv:math/0312440. doi:10.17323/1609-4514-2004-4-1-245-305. S2CID 11845578.
  166. ^ Crandall, Richard; Pomerance, Carl (2000). Prime Numbers: A Computational Perspective. Springer. p. 417. ISBN 978-0387-25282-7.
  167. ^ "Beal Conjecture". American Mathematical Society. Retrieved 21 August 2016.
  168. ^ Cai, Tianxin; Chen, Deyi; Zhang, Yong (2015). "A new generalization of Fermat's Last Theorem". Journal of Number Theory. 149: 33–45. arXiv:1310.0897. doi:10.1016/j.jnt.2014.09.014. S2CID 119732583.
  169. ^ Mihailescu, Preda (2007). "A Cyclotomic Investigation of the Catalan–Fermat Conjecture". Mathematica Gottingensis.
  170. ^ Lenstra Jr. H.W. (1992). "On the inverse Fermat equation". Discrete Mathematics. 106–107: 329–331. doi:10.1016/0012-365x(92)90561-s.
  171. ^ Newman M (1981). "A radical diophantine equation". Journal of Number Theory. 13 (4): 495–498. doi:10.1016/0022-314x(81)90040-8.
  172. ^ Bennett, Curtis D.; Glass, A. M. W.; Székely, Gábor J. (2004). "Fermat's last theorem for rational exponents". American Mathematical Monthly. 111 (4): 322–329. doi:10.2307/4145241. JSTOR 4145241. MR 2057186.
  173. ^ Dickson 1919, pp. 688–691
  174. ^ Voles, Roger (July 1999). "Integer solutions of a−2 + b−2 = d−2". Mathematical Gazette. 83 (497): 269–271. doi:10.2307/3619056. JSTOR 3619056. S2CID 123267065.
  175. ^ Richinick, Jennifer (July 2008). "The upside-down Pythagorean Theorem". Mathematical Gazette. 92: 313–317. doi:10.1017/S0025557200183275. S2CID 125989951.
  176. ^ Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. Vol. 211. Springer-Verlag New York. p. 196.
  177. ^ Elkies, Noam (1991). "ABC implies Mordell". International Mathematics Research Notices. 1991 (7): 99–109. doi:10.1155/S1073792891000144. Our proof generalizes the known implication "effective ABC [right arrow] eventual Fermat" which was the original motivation for the ABC conjecture
  178. ^ a b c Granville, Andrew; Tucker, Thomas (2002). "It's As Easy As abc" (PDF). Notices of the AMS. 49 (10): 1224–1231.
  179. ^ Oesterlé, Joseph (1988). "Nouvelles approches du "théorème" de Fermat". Astérisque. Séminaire Bourbaki exp 694 (161): 165–186. ISSN 0303-1179. MR 0992208.
  180. ^ a b Aczel 1996, p. 69
  181. ^ Singh, p. 105
  182. ^ a b Koshy T (2001). Elementary number theory with applications. New York: Academic Press. p. 544. ISBN 978-0-12-421171-1.
  183. ^ Singh, pp. 120–125, 131–133, 295–296
  184. ^ Aczel 1996, p. 70
  185. ^ Singh, pp. 120–125
  186. ^ Singh, p. 284
  187. ^ "The Abel Prize citation 2016". The Abel Prize. The Abel Prize Committee. March 2016. Archived from the original on 20 May 2020. Retrieved 16 March 2016.
  188. ^ Singh, p. 295
  189. ^ Wheels, Life and Other Mathematical Amusements, Martin Gardner
  190. ^ Singh, pp. 295–296
  191. ^ Garmon, Jay (21 February 2006). "Geek Trivia: The math behind the myth". TechRepublic. Retrieved 21 May 2022.
  192. ^ Kasman, Alex (January 2003). "Mathematics in Fiction: An Interdisciplinary Course". PRIMUS. 13 (1): 1–16. doi:10.1080/10511970308984042. ISSN 1051-1970. S2CID 122365046.
  193. ^ Singh, Simon (2013). The Simpsons and Their Mathematical Secrets. A&C Black. pp. 35–36. ISBN 978-1-4088-3530-2.
  194. ^ Moseman, Andrew (1 September 2017). "Here's a Fun Math Goof in 'Star Trek: The Next Generation'". Popular Mechanics. Retrieved 9 June 2023.

Bibliography

edit

Further reading

edit
edit
 
Wikibooks has more on the topic of: Fermat's Last Theorem
 
Wikiquote has quotations related to Fermat's Last Theorem.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Fermat%27s_Last_Theorem&oldid=1254161484"