Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let be a countably infinite set such that for all distinct and all integers . Then
the second displayed assertion of Problem 143. This is the contrapositive of Theorem 1 of the paper on the library card koukoulopoulos_2025_erdos_s_integer_dilation_approximation_problem: if a discrete set of positive reals satisfies , then for every there are distinct and a positive integer with . The problem's hypothesis with keeps distinct elements at least apart, so is discrete, and the conclusion with is exactly what the hypothesis forbids; the upper logarithmic density of is therefore . By partial summation the same bound gives . The paper resolves the dilation approximation problem that Erdős posed in 1948 under his second hypothesis, where before it only Haight's theorem for sets with all ratios irrational was known; its proof uses the GCD graphs that Koukoulopoulos and Maynard built for the Duffin--Schaeffer conjecture inside a structure-versus-randomness dichotomy.
Covers. The assertion for every set satisfying the hypothesis, and with it the vanishing of the lower asymptotic density. It says nothing about the first displayed assertion, the convergence of , which Apicella's pending claim asserts is false, and nothing about the full density statement , which Besicovitch's primitive sets of positive upper density refute.
Standing. The site's curator credits the paper on the problem page (last
edited 24 April 2026) with a partial resolution, the assertion,
but the site labels the problem OPEN, and commentary on an open problem is not
acceptance, so no reviewed evidence is listed. The paper is an arXiv
preprint of 13 February 2025 (47 pages) with no journal reference found on
2026-10-07, and no Lean proof of it exists, so the claim stays claimed.