Waring’s Problem & Lagrange’s Four-Square Theorem

$\displaystyle \mathrm{num}\ = \square+\square+\square+\square$

Introduction

We are all familiar with the problem of splitting numbers into products of primes. This process is called factorisation. The problem of expressing numbers as sums of smaller numbers has also been studied in great depth. We call such a decomposition a partition. The Indian mathematician Ramanujan proved numerous ingenious and beautiful results in partition theory.

More generally, additive number theory is concerned with the properties and behaviour of integers under addition. In particular, it considers the expression of numbers as sums of components of a particular form, such as powers. Waring’s Problem comes under this heading.

Edward Waring

Edward Waring (1736–1798) was one of the leading British mathematicians of the eighteenth century. Originally from Shropshire, he studied in Cambridge where he was Senior Wrangler in 1757 and later became Lucasian Professor of Mathematics. Other holders of this post included Newton, Babbage, Stokes, Dirac and Hawking. Waring worked on algebraic equations, infinite series, interpolation and conic sections, but his most notable results were in number theory.

Edward Waring (1736–1798). Image: MacTutor History of Mathematics archive.

In 1770, Waring announced a conjecture about the representation of the natural numbers. He investigated how any number can be expressed as a sum of powers. He claimed that every number is a sum of 4 (or fewer) squares, a sum of 9 cubes, of 19 fourth powers, “and so on”. This implies that, for any power ${k}$ , there is some finite number ${s}$ such that every number is a sum of no more than ${s}$ ${k}$ -th powers.

We let ${g(k)}$ denote the smallest number of ${k}$ -th powers sufficient to represent every number. Since any number equals a single first power, namely the number itself, ${g(1)=1}$ . Waring claimed that ${g(2) = 4}$ , ${g(3) = 9}$ , ${g(4) = 19}$ , “and so on”, although he gave no formula for values of ${g(k)}$ when ${k>4}$ . Moreover, he gave no proof of his claims.

Lagrange’s Four-Square Theorem

Later the same year, Lagrange proved the Four-Square Theorem: any natural number can be represented as the sum of four perfect squares (we include the possiblity of zero components in the sum). The four-square theorem states that ${g(2) = 4}$ . When we consider the number 7, the representation is ${7 = 2^2+1^2+1^2+1^2}$ and no fewer than four squares suffice.

In fact, no number of the form ${8k+7}$ can be expressed as a sum of three squares. This was clarified in 1798, when Legendre showed that three squares suffice for all numbers except those of the form ${4^m(8k+7)}$ . This is Legendre’s Three-Square Theorem.

Proofs of the Four-Square Theorem are given in many textbooks (e.g., Hardy & Wright). We just note a few key points. Euler showed that if two numbers are each expressed as sums of four squares, then their product is also a sum of four squares (this is also related to the modulus of the product of two quaternions). Thus, it is enough to consider prime numbers.

Primes are of two forms, ${4k+1}$ and ${4k+3}$ . Those of the form ${4k+1}$ can be expressed as sums of two squares. Those of the form ${4k+3}$ can not. But four squares always suffice for the latter. This result for the primes was stated earlier by Fermat, but without proof.

Hilbert-Waring Theorem

When ${k=3}$ , the numbers 23 and 239 require 9 cubes, but no larger number requires more than 8. Hardy and Wright use the notation ${G(k)}$ to represent the number of ${k}$ -th powers that suffice for all numbers but for a finite set of exceptions. In some sense, ${G(k)}$ is more fundamental than ${g(k)}$ .

The four-square problem appeared long before Waring’s day, in the Arithmetica of Diophantus who lived around 250 AD. Waring’s Problem for general powers was finally proved by Hilbert in 1909 and is now known as the Hilbert-Waring Theorem. Hilbert’s proof led on to major developments in number theory. Although Hilbert proved that ${G(k)}$ is finite for all ${k}$ , he did not provide an explicit formula, and research continues on this question.

Fermats’s Polygonal Number Theorem

It is interesting that Fermat claimed to have shown the result known as the four-square theorem but, as usual, he published no proof of this, and no proof has been found amongst his papers. Indeed, he claimed a much more general result, known as Fermats’s Polygonal Number Theorem:

Every positive number n is the sum of k components each being a k-gonal number.

Thus,

${\bullet}$ Every ${n}$ is the sum of 3 triangular numbers

${\bullet}$ Every ${n}$ is the sum of 4 square numbers

${\bullet}$ Every ${n}$ is the sum of 5 pentagonal numbers

… and so on … .

Lagrange’s result covered squares. The result for triangular numbers was dealt with by Gauss, whose memorable diary entry in 1796 read

$\displaystyle \mathrm{EYPHKA: num}\ = \Delta+\Delta+\Delta \,.$

Lagrange might well have noted in his diary of 1770 that

$\displaystyle \mathrm{EYPHKA: num}\ = \square+\square+\square+\square$

although there is no record of this! The general result, for all polygonal numbers, was proved by Cauchy in 1813.

References

${\bullet}$ Hardy, G. H. and E. M. Wright: An Introduction to Number Theory. Oxford Univ. Press, (1938). Fourth Edn. (1960) 421pp.

ThatsMaths