English

Large Gaps between Primes in Arithmetic Progressions

Number Theory 2018-09-26 v1

Abstract

For (M,a)=1(M,a)=1, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where pnp^\prime_n denotes the nn-th prime that is congruent to a(modM)a\pmod{M}. We show that for any positive CC, provided XX is large enough in terms of CC, there holds \begin{equation*} G(MX;M,a)\geq(C+o(1))\varphi(M)\frac{\log X\log_2 X\log_4 X} {{(\log_3 X)}^2}, \end{equation*} uniformly for all Mκ(logX)1/5M\leq\kappa{(\log X)}^{1/5} that satisfy \begin{equation*} \omega(M)\leq \exp\biggl(\frac{\log_2 M\log_4 M}{\log_3 M}\biggr). \end{equation*}

Keywords

Cite

@article{arxiv.1809.09579,
  title  = {Large Gaps between Primes in Arithmetic Progressions},
  author = {Deniz A. Kaptan},
  journal= {arXiv preprint arXiv:1809.09579},
  year   = {2018}
}
R2 v1 2026-06-23T04:18:02.996Z