arXiv Analytics

Sign in

arXiv:1404.4007 [math.NT]AbstractReferencesReviewsResources

Bounded gaps between primes with a given primitive root

Paul Pollack

Published 2014-04-15, updated 2014-05-05Version 3

Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ 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 $m \geq 2$. If $q_1 < q_2 < q_3 < \dots$ is the sequence of primes possessing $g$ as a primitive root, then $\liminf_{n\to\infty} (q_{n+(m-1)}-q_n) \leq C_m$, where $C_m$ is a finite constant that depends on $m$ but not on $g$. We also show that the primes $q_n, q_{n+1}, \dots, q_{n+m-1}$ in this result may be taken to be consecutive.

Comments: small corrections to the treatment of \sum_1 on pp. 11--12
Categories: math.NT
Subjects: 11A07, 11N05
Related articles: Most relevant | Search more
arXiv:1503.06634 [math.NT] (Published 2015-03-23, updated 2015-04-15)
Bounded gaps between prime polynomials with a given primitive root
arXiv:1407.7186 [math.NT] (Published 2014-07-27)
Bounded gaps between primes with a given primitive root, II
arXiv:1407.1747 [math.NT] (Published 2014-07-07)
Bounded gaps between primes in special sequences