Jacobi's four-square theorem
In
).History
The theorem was proved in 1834 by
Theorem
Two representations are considered different if their terms are in different order or if the integer being squared (not just the square) is different; to illustrate, these are three of the eight different ways to represent 1:
The number of ways to represent n as the sum of four squares is eight times the sum of the divisors of n if n is odd and 24 times the sum of the odd divisors of n if n is even (see divisor function), i.e.
Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e.
We may also write this as
where the second term is to be taken as zero if n is not divisible by 4. In particular, for a prime number p we have the explicit formula r4(p) = 8(p + 1).[1]
Some values of r4(n) occur infinitely often as r4(n) = r4(2mn) whenever n is even. The values of r4(n) can be arbitrarily large: indeed, r4(n) is infinitely often larger than [1]
Proof
The theorem can be proved by elementary means starting with the Jacobi triple product.[2]
The proof shows that the
See also
Notes
- ^ a b Williams 2011, p. 119.
- JSTOR 2589321.
References
- Hirschhorn, Michael D.; McGowan, James A. (2001). "Algebraic Consequences of Jacobi's Two— and Four—Square Theorems". In Garvan, F. G.; Ismail, M. E. H. (eds.). Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics. Developments in Mathematics. Vol. 4. Springer. pp. 107–132. ISBN 978-1-4020-0101-7.
- Hirschhorn, Michael D. (1987). "A simple proof of Jacobi's four-square theorem". Proceedings of the American Mathematical Society. 101 (3): 436. .
- Williams, Kenneth S. (2011). Number theory in the spirit of Liouville. London Mathematical Society Student Texts. Vol. 76. Zbl 1227.11002.