Jacobi's four-square theorem

Last updated May 26, 2024

In number theory, 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 (of integers).

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}\displaystyle 8\sum _{m|n}m&{\text{if }}n{\text{ is odd}},\\[12pt]\displaystyle 24\sum _{{m|n} \atop {m{\text{ odd}}}}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,} \atop {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 4 (p) = 8(p + 1)$ .^[1]

Some values of $r 4 (n)$ occur infinitely often as $r 4 (n) = r 4 (2 m n)$ whenever $n$ is even. The values of $r 4 (n)$ can be arbitrarily large: indeed, $r 4 (n)$ is infinitely often larger than $8{\sqrt {\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.

Notes

1 2 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.

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes.

Amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number. That is, s(a)=b and s(b)=a, where s(n)=σ(n)-n is equal to the sum of positive divisors of n except n itself (see also divisor function).

In number theory, two integers $a$ and $b$ are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides $a$ does not divide $b$ , and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also $a$ is prime to $b$ or $a$ is coprime with $b$ .

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers $x$ , $y$ , the greatest common divisor of $x$ and $y$ is denoted $. For example, the GCD of 8 and 12 is 4, that is, gcd(8, 12) = 4 .$

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, 10 = 2 ⋅ 5 is square-free, but 18 = 2 ⋅ 3 ⋅ 3 is not, because 18 is divisible by 9 = 3². The smallest positive square-free numbers are

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as $or$

In mathematics, a divisor of an integer $also called a factor of is an integer that may be multiplied by some integer to produce In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of; this implies dividing by leaves no remainder.$

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

In mathematics, a Fermat number, named after Pierre de Fermat, the first known to have studied them, is a positive integer of the form: $where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ....$

In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is divisible by 2, and odd if it is not. For example, −4, 0, and 82 are even numbers, while −3, 5, 7, and 21 are odd numbers.

In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that:

In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals $32$ and can be written as $3 \times 3$ .

In mathematics, a multiply perfect number is a generalization of a perfect number.

Lagrange's four-square theorem, also known as Bachet's conjecture, states that every natural number can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four.

<span class="mw-page-title-main">Divisor function</span> Arithmetic function related to the divisors of an integer

In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer. It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.

In mathematics, the Gauss circle problem is the problem of determining how many integer lattice points there are in a circle centered at the origin and with radius $. This number is approximated by the area of the circle, so the real problem is to accurately bound the error term describing how the number of points differs from the area. The first progress on a solution was made by Carl Friedrich Gauss, hence its name.$

In number theory, the sum of two squares theorem relates the prime decomposition of any integer $n > 1$ to whether it can be written as a sum of two squares, such that $n = a 2 + b 2$ for some integers $a$ , $b$ .

An integer greater than one can be written as a sum of two squares if and only if its prime decomposition contains no factor $p k$ , where prime $and k is odd.$

In number theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer $n$ as the sum of $k$ squares, where representations that differ only in the order of the summands or in the signs of the numbers being squared are counted as different. It is denoted by $r k (n)$ .

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. 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. Vol. 76. Cambridge University Press. ISBN 978-0-521-17562-3. Zbl 1227.11002.

External links

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

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Williams_2011-1] 1 2 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.

[1]

[2]