Erdős Problem #4 — Lower bounds for large gaps between consecutive primes
Let be the sequence of consecutive primes. [...] . [...] Sharpening previous results of Backlund, Brauer-Zeitz, and Westzynthius, I proved [11] by using Brun's method that for infinitely many
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 and every
(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 by [11].
References
P. Erdős, Some recent advances and current problems in number theory, Lectures on Modern Mathematics III, Wiley (1965), 196-244.
Progress summary
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.