On Waring's Problem IX
Jump To References Section
DOI:
https://doi.org/10.18311/jims/1939/17277Abstract
Vinogradow has proved not only the amazing result that every large number is the sum of a finite number of nth powers of primes, but has also found out a formula for its upper bound. Let g1(n) denote the least value of s such that every number from the beginning is the sum of s nth powers of primes or unity. Then it is likely that when n > n0
g1(n)=2n+l-2,
where l=[(3/2)n].
The object of this paper is to prepare the way for it.