Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Context: the paper's definition of intersector sets and Sárközy's theorems, quoted there, that the squares and the shifted primes are difference intersector sets.
The examples (p. 209, unlabeled). The paper states that neither sequence is a sum intersector set.
- For one has , but (16) is not solvable.
- For one has , but (17) is not solvable.
The paper gives no reason. Every sum is , while a square is or ; and forces , so , which is not a sum of two elements at least (an observation of this page). Both conclusions allow .
The guess (p. 209, quoted). "We guess that these examples are extremal in the sense that for , , implies the solvability of both equations (16) and (17)."
The guess concerns sets of positive integers up to , as in the paper's finite setting. The paper offers it as a guess and proves nothing toward it.
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: p. 209, the paragraph after the proof of Theorem 3. The edition read is identified on the source card.
Read depth. Claims checked: the examples and the guess were read clause by clause on the printed page. Nothing here is independently reviewed.
Bears on
- Problem 438: the problem asks how large can be when contains no square. The first example gives such sets with at least elements, and the guess, for equation (16), would make the answer . The problem page records the answer , and its claim page states that Massias's construction of density shows the guess false for (16). The guess for (17) is not part of the problem.
- Problem 439: the problem asks for a monochromatic pair with a square in every finite coloring of the integers. The first example is a set of density with no square sum, the density-side fact recorded beside the problem's source key; the paper does not pose the coloring question.