← All problems

Erdős Problem #4 — Lower bounds for large gaps between consecutive primes

71 years old · traced to

Let 2=p1<p2<⋯2 = p_1 < p_2 < \cdots be the sequence of consecutive primes. [...] pn+1−pn=dnp_{n+1} - p_n = d_n. [...] Sharpening previous results of Backlund, Brauer-Zeitz, and Westzynthius, I proved [11] by using Brun's method that for infinitely many nn

dn>clog⁡nlog⁡log⁡n/(log⁡log⁡log⁡n)2.(13)d_n > c \log n \log \log n/(\log \log \log n)^2. \tag{13}

Chang [11] succeeded by a simple further idea in dispensing with Brun's method in the proof of (13), and Rankin using an improvement of our method proved that for infinitely many nn and every ϵ>0\epsilon > 0

dn>(13−ϵ)log⁡nlog⁡log⁡nlog⁡log⁡log⁡log⁡n/(log⁡log⁡log⁡n)2.(14)d_n > (\tfrac{1}{3} - \epsilon) \log n \log \log n \log \log \log \log n/(\log \log \log n)^2. \tag{14}

(14) seems to be the natural boundary of our method; the only improvement of (14) in the last 26 years is due to Schönhage and Rankin, who replaced the constant 13\tfrac{1}{3} by eγe^{\gamma} [11].

References

P. Erdős, Some recent advances and current problems in number theory, Lectures on Modern Mathematics III, Wiley (1965), 196-244.

Source: P. Erdős, Some recent advances and current problems in number theory, Lectures on Modern Mathematics III, Wiley (1965), 196-244.

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.