![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)
Sequences of Positive Integers Containing no p Terms in Arithmetic Progression Generated by the Greedy Algorithm
Subscribe/Renew Journal
Let Sp be the set of positive integers containing no p terms in arithmetic progression generated by the greedy algorithm. We show that for p an odd prime, the set Sp does not maximize the sum ∑a∈A 1/a , where the set A runs over all sequences of positive integers containing no p terms in arithmetic progression.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 159
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0