On the gaps between consecutive primes (Q2155613): Difference between revisions

In this very nice paper, the authors establish the results that for any \(m\geq 1\) there exist infinitely many \(n\) such that \[ p_n-p_{n-m}\leq C_m\text{ for some constant }C_m>0, \] where the standard notation is used, namely \(p_n\) denotes the \(n\)-th prime number, as well as \[ p_{n+1}-p_n\geq \frac{c_m \log n \log\log n\log\log\log\log n}{\log\log\log n},\text{ for some small constant }c_m>0. \] Additionally, the authors present the result that for any fixed positive integer \(l\), there are many positive integers \(k\) with \((k,l)=1\) such that \[ p'(k,l)\geq ck\cdot \frac{ \log k \log\log k\log\log\log\log k}{\log\log\log k} \] where \(p'(k,l)\) denotes the least prime of the form \(kn+l\) with \(n\geq 1\), which actually improves upon the previous result of \textit{K. Prachar} [J. Reine Angew. Math. 206, 3--4 (1961; Zbl 0097.26001)]. Overall, the paper is very well written with the results being presented and proved in a clear and rigorous manner. An additional very nice aspect of the paper is that it presents an informative introduction presenting the background and essential results that have been proved lately on this fascinating and demanding topic.