English

Bounded gaps between primes with a given primitive root

Number Theory 2016-01-20 v3

Abstract

Fix an integer g1g \neq -1 that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which gg is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the Generalized Riemann Hypothesis (GRH). We inject Hooley's analysis into the Maynard--Tao work on bounded gaps between primes. This leads to the following GRH-conditional result: Fix an integer m2m \geq 2. If q1<q2<q3<q_1 < q_2 < q_3 < \dots is the sequence of primes possessing gg as a primitive root, then lim infn(qn+(m1)qn)Cm\liminf_{n\to\infty} (q_{n+(m-1)}-q_n) \leq C_m, where CmC_m is a finite constant that depends on mm but not on gg. We also show that the primes qn,qn+1,,qn+m1q_n, q_{n+1}, \dots, q_{n+m-1} in this result may be taken to be consecutive.

Keywords

Cite

@article{arxiv.1404.4007,
  title  = {Bounded gaps between primes with a given primitive root},
  author = {Paul Pollack},
  journal= {arXiv preprint arXiv:1404.4007},
  year   = {2016}
}

Comments

small corrections to the treatment of \sum_1 on pp. 11--12

R2 v1 2026-06-22T03:51:35.673Z