On the density of sequences of integers the sum of no two of which is a square II. General sequences

J. C. Lagarias, A. M. Odlyzko, J. B. Shearer

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

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 languageEnglish (US)
Pages (from-to)123-139
Number of pages17
JournalJournal of Combinatorial Theory, Series A
Volume34
Issue number2
DOIs
StatePublished - Mar 1983

Fingerprint

Dive into the research topics of 'On the density of sequences of integers the sum of no two of which is a square II. General sequences'. Together they form a unique fingerprint.

Cite this