← All problems

Erdős Problem #309 — Integer values of finite unit-fraction subset sums

46 years old · traced to

For each positive integer NN, let F(N)F(N) be the number of integers representable as a sum of distinct unit fractions whose denominators lie between 11 and NN; equivalently, define

F(N)=∣{m∈Z:m=∑k=1Nϵkk for some (ϵ1,…,ϵN)∈{0,1}N}∣.F(N)=\left|\left\{m\in\mathbb Z: m=\sum_{k=1}^{N}\frac{\epsilon_k}{k}\text{ for some }(\epsilon_1,\ldots,\epsilon_N)\in\{0,1\}^{N}\right\}\right|.

The question is to estimate F(N)F(N) as N→∞N\to\infty, and in particular to decide whether F(N)=o(log⁡N)F(N)=o(\log N). 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 1,1/2,…,1/N1,1/2,\ldots,1/N: each denominator can be used at most once, and only sums that are integers contribute to F(N)F(N). Erdős and Graham posed the problem in their 1980 collection of questions in combinatorial number theory. The total sum HN=∑k=1N1/kH_N=\sum_{k=1}^{N}1/k gives an immediate scale for the count: all represented integers lie between 00 and HNH_N, so F(N)≤⌊HN⌋+1=log⁡N+O(1)F(N)\leq \lfloor H_N\rfloor+1=\log N+O(1). 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).

Source: 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

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.