Math 2.0

statement theorem

Fermat's Last Theorem

Statement

Let nn be an integer with n>2n > 2. Then there are no positive integers aa, bb and cc with an+bn=cna^n + b^n = c^n.

Remarks

For n=2n = 2 there are infinitely many solutions, the Pythagorean triples. It is enough to prove the theorem for n=4n = 4 and for each odd prime nn, because each n>2n > 2 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 a2+b2=c2a^2 + b^2 = c^2 has many whole-number solutions, such as 32+42=523^2 + 4^2 = 5^2. 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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Diophantine equation concept
  2. Fermat's Last Theorem statement

Sources

  1. Web https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem, Wiles's general proof