Erdős Problem #309 — Integer values of finite unit-fraction subset sums
For each positive integer , let be the number of integers representable as a sum of distinct unit fractions whose denominators lie between and ; equivalently, define
The question is to estimate as , and in particular to decide whether . Erdős and Graham (1980) Erdős and Graham (1980)
Background
This is a counting problem for subset sums of the fixed sequence of unit fractions : each denominator can be used at most once, and only sums that are integers contribute to . Erdős and Graham posed the problem in their 1980 collection of questions in combinatorial number theory. The total sum gives an immediate scale for the count: all represented integers lie between and , so . Erdős and Graham (1980) Erdős Problems #309
References
P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).
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.