Math 2.0

statement theorem

Fermat's Last Theorem for n = 3

Statement

There are no positive integers aa, bb and cc with a3+b3=c3a^3 + b^3 = c^3.

Remarks

A sum of two positive cubes is never a cube. Standard proofs use infinite descent in the ring Z[ω]\mathbb{Z}[\omega] of Eisenstein integers, where ω\omega is a primitive cube root of unity. This case is part of Fermat's Last Theorem.

History

Fermat mentioned the case n=3n = 3 in letters of 1636, 1640 and 1657. Euler published a proof in 1770. Many other proofs followed, for example by Legendre.

Explanations

L1 human

You can never write a cube as a sum of two positive cubes. For example, 63=2166^3 = 216, and 33+43+53=2163^3 + 4^3 + 5^3 = 216 needs three cubes, not two.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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. Proof by infinite descent concept
  2. Fermat's Last Theorem for n = 3 statement

Sources

  1. Web https://en.wikipedia.org/wiki/Proof_of_Fermat%27s_Last_Theorem_for_specific_exponents, n = 3