Erdős Problem #143 — Sparse sets with multiplicative separation
Let be a countably infinite subset of satisfying the separation condition that for every pair of distinct and every integer ,
The question asks whether this forces to be “sparse,” and specifically asks whether either of the following conclusions must hold:
The word “sparse” is not separately defined in the problem; these are the two concrete bounds given there. Erdős Problems, Problem #143
Background
This integer-dilation approximation problem goes back to Erdős in 1948. In its approximation form, it asks whether a sufficiently large set of positive reals must contain distinct elements for which is arbitrarily small for some positive integer . The separation condition here rules out such a pair at every scale below . The integer setting explains the connection with primitive sets: for a set of integers, the condition is equivalent to saying that no distinct elements divide one another. The real-variable problem is a broader analogue, without the divisibility structure available for integers. Koukoulopoulos, Lamzouri, and Lichtman, Erdős’s integer dilation approximation problem and GCD graphs (2025) Erdős Problems, Problem #143
Classical results on primitive sets provide the benchmark. Erdős proved that every primitive set of integers satisfies . Behrend proved an upper bound of order for the reciprocal sum up to , and Erdős, Sárközy, and Szemerédi strengthened this to . These results concern integer sets; they do not by themselves establish the corresponding convergence assertion for real sets obeying the separation condition. Koukoulopoulos, Lamzouri, and Lichtman (2025) Erdős Problems, Problem #143
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.