statement theorem
Lagrange's four-square theorem
Statement
Each natural number is a sum of four squares of integers: for some integers , , and .
Remarks
For example, and . Three squares are not enough: is not a sum of three squares, by Legendre's three-square theorem. By Euler's four-square identity, it is enough to prove the theorem for primes. Other proofs use Minkowski's theorem or the Hurwitz quaternions.
History
Diophantus knew examples, and Bachet stated the theorem in his Latin translation of the Arithmetica of 1621. Lagrange gave the first proof in 1770.
Explanations
L1 human
Every whole number is a sum of at most four perfect squares, if you allow as a square. Some numbers, such as , and , need all four.
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
- Euler's four-square identity statement
- Lagrange's four-square theorem statement
Sources
- Web https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem, lead section
- Web https://en.wikipedia.org/wiki/Lagrange%27s_four-square_theorem, Historical development
What links here
No node links to this node yet.