English

On the gaps between consecutive primes

Number Theory 2018-02-08 v1 Combinatorics

Abstract

Let pnp_n denote the nn-th prime. For any m1m\geq 1, there exist infinitely many nn such that pnpnmCmp_{n}-p_{n-m}\leq C_m for some large constant Cm>0C_m>0, and pn+1pncmlognloglognloglogloglognlogloglogn,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 cm>0c_m>0. Furthermore, we also obtain a related result concerning the least primes in arithmetic progressions.

Keywords

Cite

@article{arxiv.1802.02470,
  title  = {On the gaps between consecutive primes},
  author = {Yu-Chen Sun and Hao Pan},
  journal= {arXiv preprint arXiv:1802.02470},
  year   = {2018}
}

Comments

This is a very very preliminary draft, which maybe contains some mistakes

R2 v1 2026-06-23T00:14:39.204Z