![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)
Waring's Problem for Powers of Primes II
Subscribe/Renew Journal
In a recent paper, Pillai has examined one of my conjectures and proved the
THEOREM. If l ≤r ≤ 2n-2l-2 and n ≥ 20, then every integer not exceeding N is the sum of at most I nth powers of primes ≥ 1,
where
N = c(1.6)n/6.31n,
3n = 1.2r+r,
and
I = 2n+l-2.
He has not stated how far his theorem holds for values of n < 20. The object of the present paper is to study the validity of Pillai's theorem when n ≤ 19.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 185
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0