# Waring's problem

(Redirected from Hilbert–Waring theorem)

In number theory, Waring's problem, proposed in 1770 by Edward Waring, asks whether for every natural number k there exists an associated positive integer s such that every natural number is the sum of at most s kth powers of natural numbers (for example, every number is the sum of at most 4 squares, or 9 cubes, or 19 fourth powers, etc.). The affirmative answer, known as the Hilbert–Waring theorem, was provided by Hilbert in 1909.[1] Waring's problem has its own Mathematics Subject Classification, 11P05, "Waring's problem and variants."

## Relationship with Lagrange's four-square theorem

Long before Waring posed his problem, Diophantus had asked whether every positive integer could be represented as the sum of four perfect squares greater than or equal to zero; this later became known as Bachet's conjecture, after the 1621 translation of Diophantus by Claude Gaspard Bachet de Méziriac, and it was solved by Joseph-Louis Lagrange in his four-square theorem in 1770, the same year Waring made his conjecture. Waring sought to generalize this problem by trying to represent all positive integers as the sum of cubes, integers to the fourth power, and so forth, to show that any positive integer may be represented as the sum of other integers raised to a specific exponent, and that there was always a maximum number of integers raised to a certain exponent required to represent all positive integers in this way.

## The number g(k)

For every k, we denote by g(k) the minimum number s of kth powers needed to represent all integers. Note we have g(1) = 1. Some simple computations show that 7 requires 4 squares, 23 requires 9 cubes, and 79 requires 19 fourth-powers; these examples show that g(2) ≥ 4, g(3) ≥ 9, and g(4) ≥ 19. Waring conjectured that these values were in fact the best possible.

Lagrange's four-square theorem of 1770 states that every natural number is the sum of at most four squares; since three squares are not enough, this theorem establishes g(2) = 4. Lagrange's four-square theorem was conjectured in Bachet's 1621 edition of Diophantus's Arithmetica; Fermat claimed to have a proof, but did not publish it.[2]

Over the years various bounds were established, using increasingly sophisticated and complex proof techniques. For example, Liouville showed that g(4) is at most 53. Hardy and Littlewood showed that all sufficiently large numbers are the sum of at most 19 fourth powers.

That g(3) = 9 was established from 1909 to 1912 by Wieferich[3] and A. J. Kempner,[4] g(4) = 19 in 1986 by R. Balasubramanian, F. Dress, and J.-M. Deshouillers,[5][6] g(5) = 37 in 1964 by Chen Jingrun, and g(6) = 73 in 1940 by Pillai.[7]

Let [x] and {x} denote the integral and fractional part of x respectively. Since 2k[(3/2)k]-1<3k only 2k and 1k can be used to represent this number and the most economical representation requires [(3/2)k]-1 2ks and 2k-1 1ks it follows that g(k) is at least as large as 2k + [(3/2)k] − 2. J. A. Euler, the son of Leonhard Euler, conjectured about 1772 that, in fact, g(k) = 2k + [(3/2)k] − 2.[8] Later work by Dickson, Pillai, Rubugunday, Niven[9] and many others have proved that

g(k) = 2k + [(3/2)k] − 2                 if   2k{(3/2)k} + [(3/2)k] ≤ 2k
g(k) = 2k + [(3/2)k] + [(4/3)k] − 2   if   2k{(3/2)k} + [(3/2)k] > 2k   and   [(4/3)k][(3/2)k] + [(4/3)k] + [(3/2)k] = 2k
g(k) = 2k + [(3/2)k] + [(4/3)k] − 3   if   2k{(3/2)k} + [(3/2)k] > 2k   and   [(4/3)k][(3/2)k] + [(4/3)k] + [(3/2)k] > 2k.

No values of k are known for which 2k{(3/2)k} + [(3/2)k] > 2k, Mahler[10] has proved there can only be a finite number of such k and Kubina and Wunderlich [11] have shown that any such k must satisfy k > 471,600,000. Thus it is conjectured that this never happens, i.e. that   g(k) = 2k + [(3/2)k] − 2   for each positive integer k.

The first few values of g(k) are:

1, 4, 9, 19, 37, 73, 143, 279, 548, 1079, 2132, 4223, 8384, 16673, 33203, 66190, 132055 ... (sequence A002804 in OEIS).

## The number G(k)

From the work of Hardy and Littlewood, the related quantity G(k) turned out to be more fundamental than g(k). G(k) is defined to be the least positive integer s such that every sufficiently large integer (i.e. every integer greater than some constant) can be represented as a sum of at most s kth powers of positive integers. Since squares are congruent to 0, 1, or 4 (mod 8), no integer congruent to 7 (mod 8) can be represented as a sum of three squares, implying that G(2) ≥ 4. Since G(k) ≤ g(k) for all k, this shows that G(2) = 4. Davenport showed that G(4) = 16 in 1939, by demonstrating that any sufficiently large number congruent to 1 through 14 mod 16 could be written as a sum of 14 fourth powers (Vaughan in 1985 and 1989 reduced the 14 successively to 13 and 12). The exact value of G(k) is unknown for any other k, but there exist bounds.

### Lower bounds for G(k)

Bounds
4 = G(2) = 4
4 ≤ G(3) ≤ 7
16 ≤ G(4) ≤ 16
6 ≤ G(5) ≤ 17
9 ≤ G(6) ≤ 24
8 ≤ G(7) ≤ 33
32 ≤ G(8) ≤ 42
13 ≤ G(9) ≤ 50
12 ≤ G(10) ≤ 59
12 ≤ G(11) ≤ 67
16 ≤ G(12) ≤ 76
14 ≤ G(13) ≤ 84
15 ≤ G(14) ≤ 92
16 ≤ G(15) ≤ 100
64 ≤ G(16) ≤ 109
18 ≤ G(17) ≤ 117
27 ≤ G(18) ≤ 125
20 ≤ G(19) ≤ 134
25 ≤ G(20) ≤ 142

The number G(k) is greater than or equal to

2r + 2             if k = 2r with r ≥ 2, or k = 3×2r;
pr + 1             if p is a prime greater than 2 and k = pr(p − 1);
(pr + 1 − 1)/2   if p is a prime greater than 2 and k = pr(p − 1)/2;
k + 1             for all integers k greater than 1.

In the absence of congruence restrictions, a density argument suggests that G(k) should equal k + 1.

### Upper bounds for G(k)

G(3) is at least four (since cubes are congruent to 0, 1 or −1 mod 9); for numbers less than 1.3×109, 1290740 is the last to require six cubes, and the number of numbers between N and 2N requiring five cubes drops off with increasing N at sufficient speed to have people believe G(3)=4;[12] the largest number now known not to be a sum of four cubes is 7373170279850,[13] and the authors give reasonable arguments there that this may be the largest possible. The upper bound G(3) ≤ 7 is due to Linnik.[14]

13792 is the largest number to require seventeen fourth powers (Deshouillers, Hennecart and Landreau showed in 2000[15] that every number between 13793 and 10245 required at most sixteen, and Kawada, Wooley and Deshouillers extended Davenport's 1939 result to show that every number above 10220 required no more than sixteen). Sixteen fourth powers are always needed to write a number of the form 31·16n.

617597724 is the last number less than 1.3×109 which requires ten fifth powers, and 51033617 the last number less than 1.3×109 which requires eleven.

The upper bounds on the right with k=5,...,20 are due to Vaughan and Wooley.[16]

Using his improved Hardy-Littlewood method, I. M. Vinogradov published numerous refinements leading to

$G(k)\le k(3\log k +11)$

in 1947 and, ultimately,

$G(k)\le k(2\log k +2\log\log k + C\log\log\log k)$

for an unspecified constant C and sufficiently large k in 1959.

Applying his p-adic form of the Hardy-Littlewood-Ramanujan-Vinogradov method to estimating trigonometric sums, in which the summation is taken over numbers with small prime divisors, Anatolii Alexeevitch Karatsuba obtained[17] (1985) a new estimate of the Hardy function $G(n)$ (for $n \ge 400$):

$\! G(n) < 2 n\log n + 2 n\log\log n + 12 n.$

Further refinements were obtained by Vaughan [1989].

Wooley then established that for some constant C,[18]

$G(k)\le k\log k+k\log\log k+Ck.$

Vaughan and Wooley have written a comprehensive survey article.[16]

## Notes

1. ^ D. Hilbert (1909). "Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n-ter Potenzen (Waringsches Problem)". Mathematische Annalen 67: 281–300.
2. ^ Dickson, Leonard Eugene (1920). "Chapter VIII". History of the Theory of Numbers, Volume II: Diophantine Analysis. Carnegie Institute of Washington.
3. ^ Wieferich, Arthur (1909). "Beweis des Satzes, daß sich eine jede ganze Zahl als Summe von höchstens neun positiven Kuben darstellen läßt". Mathematische Annalen 66 (1): 95–101. doi:10.1007/BF01450913.
4. ^ Kempner, Aubrey (1912). "Bemerkungen zum Waringschen Problem". Mathematische Annalen 72 (3): 387–399. doi:10.1007/BF01456723.
5. ^ Balasubramanian, Ramachandran; Deshouillers, Jean-Marc; Dress, François, Problème de Waring pour les bicarrés. I. Schéma de la solution. (French. English summary) [Waring's problem for biquadrates. I. Sketch of the solution] C. R. Acad. Sci. Paris Sér. I Math. 303 (1986), no. 4, pp. 85-88
6. ^ Balasubramanian, Ramachandran; Deshouillers, Jean-Marc; Dress, François, Problème de Waring pour les bicarrés. II. Résultats auxiliaires pour le théorème asymptotique. (French. English summary) [Waring's problem for biquadrates. II. Auxiliary results for the asymptotic theorem] C. R. Acad. Sci. Paris Sér. I Math. 303 (1986), no. 5, pp. 161-163
7. ^ Pillai, S. S. "On Waring's problem g(6)=73". Proc. Indian Acad. Sci. 12A: 30–40.
8. ^ L. Euler "Opera postuma" (1), 203-204 (1862)
9. ^ Niven, Ivan M. (1944). "An unsolved case of the Waring problem". American Journal of Mathematics (The Johns Hopkins University Press) 66 (1): 137–143. doi:10.2307/2371901. JSTOR 2371901.
10. ^ Mahler, K. (1957). "On the fractional parts of the powers of a rational number II". Mathematika 4: 122–124.
11. ^ Kubina, J. M. and Wunderlich, M. C. "Extending Waring's conjecture to 471,600,000" Math. Comp. (55) 815--820 (1990)
12. ^ Nathanson (1996)p.71
13. ^ Deshouillers, Jean-Marc; Hennecart, François; Landreau, Bernard; I. Gusti Putu Purnaba, Appendix by (2000). "7373170279850". Mathematics of Computation 69 (229): 421–439. doi:10.1090/S0025-5718-99-01116-3.
14. ^ Nathanson (1996) p.46,71
15. ^ Deshouillers, Jean-Marc; Hennecart, François; Landreau, Bernard (2000). "Waring's Problem for sixteen biquadrates - numerical results". Journal de théorie des nombres de Bordeaux 12: 411–422.
16. ^ a b R. C. Vaughan, Trevor Wooley (2002). Waring's Problem: A Survey Number Theory for the Millennium III. A. K. Peters. pp. 301–340. ISBN 978-1-56881-152-9.
17. ^ Karatsuba, A. A. (1985). "On the function G(n) in Waring's problem". Izv. Akad. Nauk SSSR, Ser. Math. (49:5): 935–947.
18. ^ Vaughan, R.C. (1997). The Hardy-Littlewood method. Cambridge Tracts in Mathematics 125 (2nd ed.). Cambridge: Cambridge University Press. ISBN 0-521-57347-5. Zbl 0868.11046.

## References

• G. I. Arkhipov, V. N. Chubarikov, A. A. Karatsuba, "Trigonometric sums in number theory and analysis". Berlin–New-York: Walter de Gruyter, (2004).
• G. I. Arkhipov, A.A. Karatsuba, V. N. Chubarikov, "Theory of multiple trigonometric sums". Moscow: Nauka, (1987).
• Yu. V. Linnik, "An elementary solution of the problem of Waring by Schnirelman's method". Mat. Sb., N. Ser. 12 (54), 225–230 (1943).
• R. C. Vaughan, "A new iterative method in Waring's problem". Acta Mathematica (162), 1-71 (1989).
• I. M. Vinogradov "The method of trigonometrical sums in the theory of numbers". Trav. Inst. Math. Stekloff (23), 109 pp (1947).
• I. M. Vinogradov "On an upper bound for G(n)". Izv. Akad. Nauk SSSR Ser. Mat. (23), 637-642 (1959).
• I. M. Vinogradov, A. A. Karatsuba, "The method of trigonometric sums in number theory", Proc. Steklov Inst. Math., 168, 3–30 (1986); translation from Trudy Mat. Inst. Steklova, 168, 4–30 (1984).
• W. J. Ellison: Waring's problem. American Mathematical Monthly, volume 78 (1971), pp. 10–36. Survey, contains the precise formula for g(k), a simplified version of Hilbert's proof and a wealth of references.
• Khinchin, A. Ya. (1998). Three Pearls of Number Theory. Mineola, NY: Dover. ISBN 978-0-486-40026-6 Has an elementary proof of the existence of G(k) using Schnirelmann density.
• Nathanson, Melvyn B. (1996). Additive Number Theory: The Classical Bases. Graduate Texts in Mathematics 164. Springer-Verlag. ISBN 0-387-94656-X. Zbl 0859.11002. Has proofs of Lagrange's theorem, the polygonal number theorem, Hilbert's proof of Waring's conjecture and the Hardy-Littlewood proof of the asymptotic formula for the number of ways to represent N as the sum of s kth powers.
• Hans Rademacher and Otto Toeplitz, The Enjoyment of Mathematics (1933) (ISBN 0-691-02351-4). Has a proof of the Lagrange theorem, accessible to high school students.