← All problems

Erdős Problem #311 — Exponential discrepancy of reciprocal subset sums

46 years old · traced to

For a positive integer NN, write [N]={1,…,N}[N]=\{1,\ldots,N\}. For each subset A⊆[N]A\subseteq[N], let its reciprocal sum be ∑n∈A1/n\sum_{n\in A}1/n, with the empty sum equal to 00. Define the smallest nonzero discrepancy from 11 by

δ(N)=min⁡A⊆[N]∑n∈A1/n≠1∣1−∑n∈A1n∣.\delta(N)=\min_{\substack{A\subseteq[N]\\ \sum_{n\in A}1/n\ne 1}}\left|1-\sum_{n\in A}\frac1n\right|.

Is there a constant c∈(0,1)c\in(0,1), independent of NN, such that as N→∞N\to\infty

δ(N)=exp⁡(−(c+o(1))N)?\delta(N)=\exp\bigl(-(c+o(1))N\bigr)?

Erdős Problems #311

Background

This is a problem about how closely a finite sum of distinct unit fractions with denominators at most NN can approximate 11 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 AA contain no subset whose reciprocal sum is 11; 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

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.