Abstract
The aim of this paper is to study the maximal density attainable by a sequence S of positive integers having the property that the sum of any two distinct elements of S is never a square. It is shown that there is a constant N0 such that for all N ≥ N0 any set S ⊆ [1, N] having this property must have |S| < 0.475N. The proof uses the Hardy-Littlewood circle method.
Original language | English (US) |
---|---|
Pages (from-to) | 123-139 |
Number of pages | 17 |
Journal | Journal of Combinatorial Theory, Series A |
Volume | 34 |
Issue number | 2 |
DOIs | |
State | Published - Mar 1983 |