Wiki
Wiki

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

Updated


Statement

There is an absolute constant C≥1C\ge1 such that, for every ε>0\varepsilon>0 and all sufficiently large NN depending on ε\varepsilon, if A⊆[1,N]A\subseteq[1,N], ∣A∣≥αN|A|\ge\alpha N, and

(log⁡N)−1/7+ε≤α≤1/2,(\log N)^{-1/7+\varepsilon}\le\alpha\le1/2,

then there are integers 1≤s≤t≤exp⁡(C/α)1\le s\le t\le\exp(C/\alpha) and B⊆AB\subseteq A with ∑n∈B1/n=s/t\sum_{n\in B}1/n=s/t. The paper does not require s/ts/t to be in lowest terms.

Source. Liu–Sawhney, arXiv:2404.07113v1, Proposition 1.4, p. 2; remarks p. 3; proof p. 21. Read depth: claims checked (the statement on p. 2 and the remarks on p. 3 were re-read clause by clause in the text layer on 2026-09-18 and agree with the statement above); the proof is not verified, and the coverage gap below stands. The published version (Int. Math. Res. Not. 2026, no. 2, rnaf382) was not compared.

Proof pointer and sketch

Localize to a dyadic interval retaining reciprocal mass comparable to α\alpha. Delete non-smooth integers and those with too many prime factors, and prune thin prime-power fibers. The paper applies Proposition 5.2 with δ=1/7\delta=1/7 and its second term in Γ\Gamma. A sieve argument locates a prime divisor p∈[10/α2,exp⁡(C/α)]p\in[10/\alpha^2,\exp(C/\alpha)] of a surviving denominator. Since pp divides the common denominator QQ, the proof chooses a rational with denominator pp as its target, subject to the checks below.

The exponential dependence is sharp up to constants: consider integers in [N/2,N][N/2,N] with no prime factor below L=exp⁡(c/α)L=\exp(c/\alpha), where c>0c>0 is sufficiently small. The sieve gives at least αN\alpha N such integers for sufficiently large NN. Their total reciprocal mass is below one. Every nonempty subsum, after reduction, has a denominator greater than one with no prime divisor below LL; its denominator is therefore at least LL.

Coverage gap. Full proof and independent verification are required for Problem 310. The printed choice M=N/2M=N/2 violates Proposition 5.2's stated M≤N/104M\le N/10^4. The fixed choice ϵ=1/1000\epsilon=1/1000 in the proof's parameter check does not establish the claimed inequality for arbitrarily small ε0>0\varepsilon_0>0. The displayed numerator of Γ\Gamma also has 1−δ1-\delta where the proposition states 1−2δ1-2\delta. Finally the chosen target ⌊R(A)p/5⌋/p\lfloor R(A)p/5\rfloor/p must be checked against the earlier announced interval [α/128,α/32][\alpha/128,\alpha/32]. These discrepancies are recorded without inventing replacements; compare the published version first.

Dependencies and historical relation

Same-paper Lemmas 2.2, 2.3, 2.4, 6.2 and Proposition 5.2. The remarks on p. 3 explain that Bloom's Proposition 1 already yields a denominator Oα(1)O_\alpha(1) for fixed positive α\alpha, solving the original qualitative question. Liu–Sawhney supply the stated dependence on α\alpha and the logarithmically small density range.

Bears on