← All problems

Erdős Problem #312 — Subset sums of reciprocals near one

46 years old · traced to

Let AA be a finite multiset of positive integers, and let S⊆AS\subseteq A mean a submultiset that uses each integer no more often than it occurs in AA. Write

R(S)=∑n∈S1n,\mathcal R(S)=\sum_{n\in S}\frac1n,

with multiplicities included. The question is whether there exists an absolute constant c>0c>0 such that, for every K>1K>1, whenever AA is a sufficiently large finite multiset with R(A)>K\mathcal R(A)>K, some submultiset S⊆AS\subseteq A satisfies

1−e−cK<R(S)≤1.1-e^{-cK}<\mathcal R(S)\leq 1.

Erdős Problems #312

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 11 and within order K−2K^{-2} of 11 when the total reciprocal sum exceeds KK. The question asks whether the deficit can instead be made exponentially small in KK. 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

Progress summary

Never refreshed

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.