Erdős Problem #311 — Exponential discrepancy of reciprocal subset sums
For a positive integer , write . For each subset , let its reciprocal sum be , with the empty sum equal to . Define the smallest nonzero discrepancy from by
Is there a constant , independent of , such that as
Background
This is a problem about how closely a finite sum of distinct unit fractions with denominators at most can approximate without equalling it. Erdős and Graham included it in Old and new problems and results in combinatorial number theory (1980). Their formulation imposed the additional restriction that contain no subset whose reciprocal sum is ; the equivalent unrestricted formulation above is attributed to Vjekoslav Kovac's comment on the problem. Erdős Problems #311 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.