Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Let A⊂(1,∞)A\subset(1,\infty) be a countably infinite set such that ∣kx−y∣≥1\lvert kx-y\rvert\ge1 for all distinct x,y∈Ax,y\in A and all integers k≥1k\ge1. Then

∑x<nx∈A1x=o(log⁡n),\sum_{\substack{x<n\\ x\in A}}\frac{1}{x}=o(\log n),

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 AA of positive reals satisfies lim sup⁡x→∞(log⁡x)−1∑α∈A∩[1,x]1/α>0\limsup_{x\to\infty}(\log x)^{-1}\sum_{\alpha\in A\cap[1,x]}1/\alpha>0, then for every ϵ>0\epsilon>0 there are distinct α,β∈A\alpha,\beta\in A and a positive integer nn with ∣nα−β∣<ϵ\lvert n\alpha-\beta\rvert<\epsilon. The problem's hypothesis with k=1k=1 keeps distinct elements at least 11 apart, so AA is discrete, and the conclusion with ϵ=1\epsilon=1 is exactly what the hypothesis forbids; the upper logarithmic density of AA is therefore 00. By partial summation the same bound gives lim inf⁡x→∞∣A∩[1,x]∣/x=0\liminf_{x\to\infty}\lvert A\cap[1,x]\rvert/x=0. 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 o(log⁡n)o(\log n) assertion for every set AA satisfying the hypothesis, and with it the vanishing of the lower asymptotic density. It says nothing about the first displayed assertion, the convergence of ∑x∈A1/(xlog⁡x)\sum_{x\in A}1/(x\log x), which Apicella's pending claim asserts is false, and nothing about the full density statement lim⁡∣A∩[1,x]∣/x=0\lim\lvert A\cap[1,x]\rvert/x=0, 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 o(log⁡n)o(\log n) 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.