About the Project
NIST

Waring problem

AdvancedHelp

(0.001 seconds)

3 matching pages

1: 27.13 Functions
§27.13(iii) Waring’s Problem
This problem is named after Edward Waring who, in 1770, stated without proof and with limited numerical evidence, that every positive integer n is the sum of four squares, of nine cubes, of nineteen fourth powers, and so on. Waring’s problem is to find, for each positive integer k , whether there is an integer m (depending only on k ) such that the equation …
2: Bibliography E
  • W. J. Ellison (1971) Waring’s problem. Amer. Math. Monthly 78 (1), pp. 10–36.
  • 3: Bibliography H
  • G. H. Hardy and J. E. Littlewood (1925) Some problems of “Partitio Numerorum” (VI): Further researches in Waring’s Problem. Math. Z. 23, pp. 1–37.