![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
On Waring's Problem IX
Subscribe/Renew Journal
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.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 150
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0