Erdős Problem #312 — Subset sums of reciprocals near one
Let be a finite multiset of positive integers, and let mean a submultiset that uses each integer no more often than it occurs in . Write
with multiplicities included. The question is whether there exists an absolute constant such that, for every , whenever is a sufficiently large finite multiset with , some submultiset satisfies
Background
This unit-fraction problem is attributed to Erdős and Graham’s 1980 work. Their known bound, as reported for the problem, guarantees a submultiset sum at most and within order of when the total reciprocal sum exceeds . The question asks whether the deficit can instead be made exponentially small in . Approximating 1 by Sums of Unit Fractions, arXiv:2607.04157 Erdős and Graham, Old and New Problems and Results in Combinatorial Number Theory (1980)
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.