Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (p. 204): is the set of the subsets of , counts the elements of up to , and is the integer part.
Theorem 4 (pp. 210--211, quoted with its displays). "Let be any irrational number. Then there exist infinitely many positive integers such that"
"imply the solvability of"
For each such the implication holds for every satisfying (19) and (20). The paper adds (p. 212) that "Theorem 4 is near best possible": the right side of (20) cannot be replaced by a function with . It gives no proof of that remark.
The section's claims (p. 210). Section 3 opens by stating that for a fixed irrational the sequence (18) is a difference intersector set but need not be a sum intersector set. For the second part, take any real with and : then , and every sum lies strictly between two consecutive elements of , so is not solvable. The first part is meant to follow from Theorem 4: an infinite of positive lower density satisfies (20) for all large , so at the infinitely many of the theorem its part up to gives a solution of (21) (this deduction is not written out in the paper).
Source. P. Erdős and A. Sárközy, On differences and sums of integers, II, Bull. Soc. Math. Grèce (N.S.) 18 (1977), no. 2, 204--223: the example on p. 210, the statement on pp. 210--211, the proof on pp. 211--212 and the remark on p. 212. The edition read is identified on the source card.
Read depth. Claims checked: the statement, the example and the remark were read clause by clause on the printed pages. The proof was read but not checked step by step. Nothing here is independently reviewed.
Proof pointer
Pp. 211--212. Take a convergent of with (22), of which there are infinitely many, and (23). Then for (24). Splitting into its residue classes modulo , (20) and (22) give a class with at least two elements; their difference is a multiple of between and , hence with .