← All problems

Erdős Problem #317 — Small signed harmonic sums and reciprocal lcm bounds

44 years old · traced to

For an integer n≥1n\geq 1 and a vector δ=(δ1,…,δn)∈{−1,0,1}n\delta=(\delta_1,\ldots,\delta_n)\in\{-1,0,1\}^n, put

Sn(δ)=∑k=1nδkk,Ln=lcm⁡(1,2,…,n).S_n(\delta)=\sum_{k=1}^{n}\frac{\delta_k}{k}, \qquad L_n=\operatorname{lcm}(1,2,\ldots,n).

The first question asks whether there is a constant c>0c>0, independent of nn, such that for every integer n≥1n\geq1 some δ∈{−1,0,1}n\delta\in\{-1,0,1\}^n satisfies

0<∣Sn(δ)∣<c2n.0<|S_n(\delta)|<\frac{c}{2^n}.

The second asks whether there is an integer NN such that, for every n≥Nn\geq N and every δ∈{−1,0,1}n\delta\in\{-1,0,1\}^n, one has

Sn(δ)≠0⟹∣Sn(δ)∣>1Ln.S_n(\delta)\ne0\quad\Longrightarrow\quad |S_n(\delta)|>\frac{1}{L_n}.

Erdős Problems #317

Background

This problem concerns how closely signed sums of the first nn unit fractions can cancel while remaining nonzero. It is recorded with the reference [ErGr80, p. 42]. The common denominator LnL_n gives an immediate arithmetic scale for the second question: multiplying any such sum by LnL_n produces an integer. The issue is therefore whether the smallest possible nonzero sum can equal that denominator-based lower bound, rather than merely whether a lower bound holds. Erdős Problems #317

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.