Erdős Problem #1185 — Dense progressions with differences from a prescribed difference set
For an integer , let , and for let . Is the following assertion true: for every real and every integer , there exist a positive integer and an integer such that, for every and all with and , there are an integer and a positive integer such that
The positivity of makes the progression nonconstant; since is symmetric, it does not change the question. Erdős Problems #1185 Erdős (1980)
Background
Erdős attributed the problem to himself and Ralph Mauldin, saying it arose from a question in measure theory. His 1980 formulation asks whether every sufficiently dense finite set contains a three-term progression whose difference is the difference of two elements of an auxiliary set of fixed size; he suggests the analogous question for longer progressions. Thus the prescribed differences are constrained by the additive structure of , rather than chosen freely. Erdős (1980)
References
P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.