|
|
A174406
|
|
a(n) = smallest number u such that almost every number is the sum of at most u n-th powers of positive numbers.
|
|
4
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A variant of Waring's problem.
"Almost all" means that the exceptions have zero density.
Only three other values of the sequence are known: a(8) = 32, a(16) = 64, and a(32) = 128. The cited survey by Vaughan and Wooley shows that G_1(8) = 32, G_1(16) = 64, and G_1(32) = 128. The quantity G_1(5) has not been evaluated, nor have G_1(6) and G_1(7). - David Covert, Jun 29 2016
|
|
LINKS
|
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.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|