pith. sign in

arxiv: 1802.02470 · v1 · pith:G6LHLXAQnew · submitted 2018-02-07 · 🧮 math.NT · math.CO

On the gaps between consecutive primes

classification 🧮 math.NT math.CO
keywords constantprimessomearithmeticconcerningconsecutivedenoteexist
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.