arXiv:1802.02470 [math.NT]AbstractReferencesReviewsResources
On the gaps between consecutive primes
Published 2018-02-07Version 1
Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$ for some small constant $c_m>0$. Furthermore, we also obtain a related result concerning the least primes in arithmetic progressions.
Comments: This is a very very preliminary draft, which maybe contains some mistakes
Related articles: Most relevant | Search more
arXiv:1808.08455 [math.NT] (Published 2018-08-25)
Additive Volume of Sets Contained in Few Arithmetic Progressions
The least modulus for which consecutive polynomial values are distinct
arXiv:1709.05335 [math.NT] (Published 2017-09-12)
On elementary estimates for sum of some functions in certain arithmetic progressions