Math 2.0

statement theorem

Legendre's three-square theorem

Statement

Let nn be a natural number. Then n=x2+y2+z2n = x^2 + y^2 + z^2 for some integers xx, yy and zz if and only if n≠4a(8b+7)n \neq 4^a (8b + 7) for all natural numbers aa and bb.

Remarks

The "only if" part is easy: a square is 00, 11 or 44 modulo 88, so no sum of three squares is 77 modulo 88. The first numbers that are not sums of three squares are 77, 1515, 2323, 2828 and 3131. 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 6=4+1+16 = 4 + 1 + 1. The exceptions are 7,15,23,…7, 15, 23, \dots, the numbers that leave remainder 77 on division by 88, and these numbers times powers of 44.

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

  1. Web https://en.wikipedia.org/wiki/Legendre%27s_three-square_theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Legendre%27s_three-square_theorem, History