OFFSET
1,2
COMMENTS
One needs only check a finite number of values (depending on the power).
See Small's paper in references for precise quantitive information.
a(2) <= 4 follows from Lagrange's four squares theorem.
Differs from A040004 only at k=4. - Andrey Zabolotskiy, Jun 03 2017
REFERENCES
G. H. Hardy and J. E. Littlewood, Some Problems of "Partitio Numerorum" (VIII): The Number Gamma(k) in Waring's Problem, Proc London Math Soc. 28 (1928), 518--542. [G. H. Hardy, Collected Papers. Vols. 1-, Oxford Univ. Press, 1966-; see vol. 1, pp. 406-530.]
Wladyslaw Narkiewicz, Rational Number Theory in the 20th Century: From PNT to FLT, Springer Science & Business Media, 2011, pages 154-155.
LINKS
H. Sekigawa and K. Koyama, Nonexistence Conditions of a Solution for the congruence x_1^k + ... + x_s^k = N (mod p^n), Math. Comp. 68 (1999), 1283--1297.
C. Small, Waring's problem mod n, Amer. Math. Monthly 84 (1977), no. 1, 12--25.
R. C. Vaughan and T. D. Wooley, Waring’s problem: a survey, Number Theory for the Millennium, III (Urbana, IL, 2000), A K Peters, Natick, MA, 2002, pp. 301-340.
EXAMPLE
a(3) <= 4 states that every element of every ring of integers mod m can be written as a sum of 4 (or fewer) cubes. a(3) >= 4, since in Z/9Z, the cubes are {0,1,8} so that 4 is not the sum of any three cubes in Z/9Z. Hence a(3) = 4.
CROSSREFS
KEYWORD
nonn
AUTHOR
David Covert, May 22 2017
EXTENSIONS
Edited by Andrey Zabolotskiy, Jun 10 2017
STATUS
approved