Waring's problem - Wikipedia, the free encyclopedia Atgritchie 0 Talk Sandbox Preferences Watchlist Contributions Log out

Article Talk

Read Edit View history

Search

Waring's problem
From Wikipedia, the free encyclopedia Main page Contents Featured content Current events Random article Donate to Wikipedia Wikimedia Shop Interaction Help About Wikipedia Community portal Recent changes Contact page Toolbox Print/export Languages Deutsch Espaol Franais Italiano Lietuvi Magyar Nederlands Polski Portugus Suomi Svenska Ting Vit Edit links

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 HilbertWaring theorem, was provided by Hilbert in 1909.[1] Waring's problem has its own Mathematics Subject Classification
Contents
[hide] 1 Relationship with Lagrange's four-square theorem 2 The number g(k) 3 The number G(k) 3.1 Lower bounds for G(k) 3.2 Upper bounds for G(k) 4 See also 5 Notes 6 References

, 11P05, "Waring's problem and variants."

Relationship with Lagrange's four-square theorem

[edit]

Prior to the posing of Waring's problem, Joseph Louis Lagrange theorized that any positive integer could be represented as the sum of four perfect squares greater than or equal to zero. Waring sought to generalize this to try to represent all positive integers as the sum of cubes, integers to the fourth power, and so forth, in order 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)

[edit]

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 fourthpowers; 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 ; 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. Chen Jingrun , and g(6) = 73 in 1940 Balasubramanian, F. Dress, and J.-M. Deshouillers ,[5][6] g(5) = 37 in 1964 by by Pillai.[7]

Let [ x] and { x} denote the integral and fractional part of x respectively. Since 2k[(3/2) k]-1<3 k only 2 k and 1 k can be used to represent this number and the most economical representation requires [(3/2)k]-1 2 ks and 2k-1 1 ks it follows
k k

https://en.wikipedia.org/wiki/Waring%27s_problem[10/9/2013 5:46:09 PM]

Waring's problem - Wikipedia, the free encyclopedia

that g(k) is at least as large as 2 + [(3/2) ] 2. J. A. Euler, the son of Leonard 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) = 2 k + [(3/2) k] 2 if 2k{(3/2)k} + [(3/2)k] 2k g(k) = 2 k + [(3/2) k] + [(4/3) k] 2 if 2k{(3/2)k} + [(3/2)k] > 2 k and [(4/3)k][(3/2)k] + [(4/3) k] + [(3/2) k] = 2 k g(k) = 2 k + [(3/2) k] + [(4/3) k] 3 if 2k{(3/2)k} + [(3/2)k] > 2 k and [(4/3)k][(3/2)k] + [(4/3) k] + [(3/2) k] > 2 k. No values of k are known for which 2 k{(3/2)k} + [(3/2)k] > 2 k, 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)

[edit]

From the work of Hardy and Littlewood , more fundamental than g(k) turned out to be G(k), which 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)

[edit] Bounds k = pr(p 1); k = p r(p 1)/2; 4 G(2) 4 4 G(3) 7 16 G(4) 16

The number G(k) is greater than or equal to 2 r + 2 if k = 2 r with r 2, or k = 32 r; pr + 1 if p is a prime greater than 2 and (pr + 1 1)/2 if p is a prime greater than 2 and 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 + 6 G(5) 17 1. 9 G(6) 24

Upper bounds for G(k)

[edit]

8 G(7) 33 32 G(8) 42

1.3 10 9, 1290740 is the last to require six cubes, and the number of numbers between N and 2N 13 G(9) 50 requiring five cubes drops off with increasing N at sufficient speed to have people believe 12 G(10) 59 G(3)=4;[12] the largest number now known not to be a sum of four cubes is 7373170279850,[13] 12 G(11) 67 and the authors give reasonable arguments there that this may be the largest possible. The upper 16 G(12) 76 bound G(3) 7 is due to Linnik.[14] 14 G(13) 84 13792 is the largest number to require seventeen fourth powers (Deshouillers, Hennecart and 15 G(14) 92 Landreau showed in 2000[15] that every number between 13793 and 10245 required at most 16 G(15) 100 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 3116n. 617597724 is the last number less than 1.3 the last number less than 1.3 10 9 which requires eleven. The upper bounds on the right with k=5,...,20 are due to 64 G(16) 109 18 G(17) 117 10 9 which requires ten fifth powers, and 51033617 27 G(18) 125 20 G(19) 134 Vaughan and Wooley .[16] 25 G(20) 142

G(3) is at least four (since cubes are congruent to 0, 1 or 1 mod 9); for numbers less than

https://en.wikipedia.org/wiki/Waring%27s_problem[10/9/2013 5:46:09 PM]

Waring's problem - Wikipedia, the free encyclopedia

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

in 1947 and, ultimately,

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 (for ):

Further in his investigation of the Waring problem Karatsuba obtained[18][19] the following two-dimensional generalization of that problem: Consider the system of equations

where exist such

are given positive integers with the same order or growth, , and if , that the system has no solutions.

, and

are unknowns, , then there

which are also positive integers. This system has solutions, if

Further minor refinements were obtained by Vaughan [1989]. Wooley then established that for some constant C,[20]

Vaughan and Wooley have written a comprehensive survey article.

[16]

See also

[edit]

Polygonal number theorem WaringGoldbach problem

Notes

[edit]

1. ^ D. Hilbert (1909). "Beweis fr die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n-ter Potenzen (Waringsches Problem)" . Mathematische Annalen 67: 281300. 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 hchstens neun positiven Kuben darstellen lt" doi:10.1007/BF01450913 . . Mathematische Annalen 66 (1): 95101. . Mathematische Annalen 72 (3):

4. ^ Kempner, Aubrey (1912). "Bemerkungen zum Waringschen Problem" 387399. doi:10.1007/BF01456723 .

5. ^ Balasubramanian, Ramachandran; Deshouillers, Jean-Marc; Dress, Franois, Problme de Waring pour les bicarrs. I. Schma de la solution. (French. English summary) [Waring's problem for biquadrates. I. Sketch of the solution] C. R. Acad. Sci. Paris Sr. I Math. 303 (1986), no. 4, pp. 85-88 6. ^ Balasubramanian, Ramachandran; Deshouillers, Jean-Marc; Dress, Franois, Problme de Waring pour les bicarrs. II. Rsultats auxiliaires pour le thorme asymptotique. (French. English summary) [Waring's problem for biquadrates. II. Auxiliary results for the asymptotic theorem] C. R. Acad. Sci. Paris Sr. 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: 3040. 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): 137143. doi:10.2307/2371901 . JSTOR2371901 . 10. ^ Mahler, K. (1957). "On the fractional parts of the powers of a rational number II". Mathematika 4: 122124.

https://en.wikipedia.org/wiki/Waring%27s_problem[10/9/2013 5:46:09 PM]

Waring's problem - Wikipedia, the free encyclopedia 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, Franois; Landreau, Bernard; I. Gusti Putu Purnaba, Appendix by (2000). "7373170279850". Mathematics of Computation 69 (229): 421439. doi:10.1090/S0025-5718-9901116-3 . 14. ^ Nathanson (1996) p.46,71 15. ^ Deshouillers, Jean-Marc; Hennecart, Franois; Landreau, Bernard (2000). "Waring's Problem for sixteen biquadrates - numerical results" . Journal de thorie des nombres de Bordeaux 12: 411422. 16. ^ a b R. C. Vaughan, Trevor Wooley (2002). Waring's Problem: A Survey Number Theory for the Millennium III. A. K. Peters. pp.301340. ISBN978-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): 935947. 18. ^ G. I. Archipov, A. A. Karatsuba (1987). "A multidimensional analogue of Waring's problem". Dokl. Akad. Nauk SSSR (295:3): 521523. 19. ^ Karatsuba, A. A. (1988). "Waring's problem in several dimensions". Mathem. Forschungs, Oberwolfach, Tagungsbericht (42): 56. 20. ^ Vaughan, R.C. (1997). The Hardy-Littlewood method. Cambridge Tracts in Mathematics 125 (2nd ed.). Cambridge: Cambridge University Press. ISBN0-521-57347-5. Zbl0868.11046 .

References

[edit]

G. I. Arkhipov, V. N. Chubarikov, A. A. Karatsuba , "Trigonometric sums in number theory and analysis". BerlinNew-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), 225230 (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, 330 (1986); translation from Trudy Mat. Inst. Steklova, 168, 430 (1984). W. J. Ellison: Waring's problem. American Mathematical Monthly, volume 78 (1971), pp.1036. 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. ISBN978-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 . Has proofs of Lagrange's Mathematics 164. Springer-Verlag. ISBN0-387-94656-X . Zbl0859.11002 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. Categories: Additive number theory Mathematical problems

This page was last modified on 1 October 2013 at 15:01. Text is available under the Creative Commons Attribution-ShareAlike License;
additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy.
Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Developers Mobile view

https://en.wikipedia.org/wiki/Waring%27s_problem[10/9/2013 5:46:09 PM]

Waring's problem - Wikipedia, the free encyclopedia

https://en.wikipedia.org/wiki/Waring%27s_problem[10/9/2013 5:46:09 PM]