statement theorem
Fermat's Last Theorem
Statement
Let be an integer with . Then there are no positive integers , and with .
Remarks
For there are infinitely many solutions, the Pythagorean triples. It is enough to prove the theorem for and for each odd prime , because each has one of these as a divisor. The cases n = 4 and n = 3 have elementary proofs.
History
Pierre de Fermat stated the theorem around 1637 and wrote that he had a proof. Andrew Wiles gave the first proof in 1994, with a step completed jointly with Richard Taylor. The proof was published in 1995. The proof uses the modularity of semistable elliptic curves.
Explanations
L1 human
The equation has many whole-number solutions, such as . For cubes, fourth powers and all higher powers, the theorem says that there are none. The statement is simple, but the proof took more than 350 years.
What this node needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Diophantine equation concept
- Fermat's Last Theorem statement
Sources
- Web https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem, lead section
- Web https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem, Wiles's general proof
What links here
No node links to this node yet.