statement theorem
Legendre's three-square theorem
Statement
Let be a natural number. Then for some integers , and if and only if for all natural numbers and .
Remarks
The "only if" part is easy: a square is , or modulo , so no sum of three squares is modulo . The first numbers that are not sums of three squares are , , , and . The theorem implies Lagrange's four-square theorem in a few lines.
History
Legendre gave the first proof in 1797 or 1798. Gauss proved a more general result in 1801.
Explanations
L1 human
Most numbers are sums of three squares, for example . The exceptions are , the numbers that leave remainder on division by , and these numbers times powers of .
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
What links here
No node links to this node yet.