Article contents
Sums of k-th powers in number fields
Published online by Cambridge University Press: 26 February 2010
Extract
As usual in Waring's problem, we let G(k) be the least number s such that all sufficiently large natural numbers can be written as the sum of s or fewer k-th powers of positive integers. Hardy and Littlewood gave the first general upper bound, G(k)≤(k − 2)2k − 1 + 5. Later [4], they reduced this to order k2 by first constructing an auxiliary set of natural numbers below x which are sums of sk-th powers, of cardinality with for large k. The argument, which is brief and elementary (see [15, Chapter 6]), is now referred to by R. C. Vaughan's term “diminishing ranges”, since the k-th powers are taken from intervals of decreasing lengths. This idea of choosing the variables from restricted ranges was refined by Vinogradov, whose application to exponential sum estimates gave for large k (see [18]). The recent iterative method of Vaughan and Wooley [16, 19, 21], which halves Vinogradov's bound, may be viewed as an evolved diminishing ranges argument, producing an auxiliary set with .
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 1998
References
- 1
- Cited by