Jacobi's four-square theorem

Jacobi's four-square theorem gives a formula for the number of ways that a given positive integer n can be represented as the sum of four squares.

History

The theorem was proved in 1834 by Carl Gustav Jakob Jacobi.

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:

{\begin{aligned}&1^{2}+0^{2}+0^{2}+0^{2}\\&0^{2}+1^{2}+0^{2}+0^{2}\\&(-1)^{2}+0^{2}+0^{2}+0^{2}.\end{aligned}}

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.

r_{4}(n)={\begin{cases}8\sum \limits _{m|n}m&{\text{if }}n{\text{ is odd}}\\[12pt]24\sum \limits _{\begin{smallmatrix}m|n\\m{\text{ odd}}\end{smallmatrix}}m&{\text{if }}n{\text{ is even}}.\end{cases}}

Equivalently, it is eight times the sum of all its divisors which are not divisible by 4, i.e.

r_{4}(n)=8\sum _{m\mid n,\,4\nmid m}m.

We may also write this as

r_{4}(n)=8\sigma (n)-32\sigma (n/4)\ ,

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 r₄(p) = 8(p + 1).[1]

Some values of r₄(n) occur infinitely often as r₄(n) = r₄(2^mn) whenever n is even. The values of r₄(n)/n can be arbitrarily large: indeed, r₄(n)/n is infinitely often larger than 8√log n.[1]

Proof

The theorem can be proved by elementary means starting with the Jacobi triple product.[2]

The proof shows that the Theta series for the lattice Z⁴ is a modular form of a certain level, and hence equals a linear combination of Eisenstein series.

gollark: Also, I think making up a dedicated assembly thing is basically the *point* of asm2bf, instead of some bizarre implementation detail like in Go.

gollark: > asm2bf has its own assembly languageIt's an esolang. Sanity and stuff don't count.

gollark: I think they are working on some codegen changes somewhere.

gollark: > Rust has llvm, which is kinda worse than an own asm because it's not even original and not even real asmIt's *better*, since it's actually used in other things and they did not make up their own for some bizarre reason.

gollark: Hmm, yes, apparently Linux has a monotonic clock thing available.

Notes

Williams 2011, p. 119.
Hirschhorn, Michael D. (2000). "Partial Fractions and Four Classical Theorems of Number Theory". The American Mathematical Monthly. 107 (3): 260–264. CiteSeerX 10.1.1.28.1615. doi:10.2307/2589321. 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. 4. Springer. pp. 107–132. CiteSeerX 10.1.1.26.9028. doi:10.1007/978-1-4613-0257-5_7. 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. doi:10.1090/s0002-9939-1987-0908644-9.
Williams, Kenneth S. (2011). Number theory in the spirit of Liouville. London Mathematical Society Student Texts. 76. Cambridge University Press. ISBN 978-0-521-17562-3. Zbl 1227.11002.CS1 maint: ref=harv (link)

External links

Weisstein, Eric W. "Sum of Squares Function". MathWorld.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[Williams_2011-1] Williams 2011, p. 119.

[2] Hirschhorn, Michael D. (2000). "Partial Fractions and Four Classical Theorems of Number Theory". The American Mathematical Monthly. 107 (3): 260–264. CiteSeerX 10.1.1.28.1615. doi:10.2307/2589321. JSTOR 2589321.