← All problems

Erdős Problem #950 — Reciprocal prime-gap sums

49 years old · traced to

For each integer n≥2n\ge 2, let the sum range over primes strictly less than nn and define

f(n)=∑p<np prime1n−p.f(n)=\sum_{\substack{p<n\\ p\text{ prime}}}\frac{1}{n-p}.

The questions are whether, with limits taken through integers,

lim inf⁡n→∞f(n)=1andlim sup⁡n→∞f(n)=∞,\liminf_{n\to\infty} f(n)=1 \qquad\text{and}\qquad \limsup_{n\to\infty} f(n)=\infty,

and whether

f(n)=o(log⁡log⁡n),f(n)=o(\log\log n),

meaning f(n)/log⁡log⁡n→0f(n)/\log\log n\to 0 as n→∞n\to\infty. Erdős Problem #950

Background

The problem is cited to Erdős’s 1977 collection, and the function was studied by de Bruijn, Erdős, and Turán. Its values aggregate primes lying immediately below nn, with nearby primes weighted more heavily by the reciprocal distance. The questions ask about extremes and pointwise growth, rather than only the average size of this prime-weighted sum. Erdős, Er77c, p. 63

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.