G M ] 6 O ct 2 01 8 Primes In Arithmetic Progressions And Primitive Roots

Content Provider	Semantic Scholar
Author	Carella, N. A.
Copyright Year	2018
Abstract	Abstract : Let x ≥ 1 be a large number, and let 1 ≤ a < q be integers such that gcd(a, q) = 1 and q = O(log) with c > 0 constant. This note proves that the counting function for the number of primes p ∈ {p = qn + a : n ≥ 1} with a fixed primitive root u 6= ±1, v2 has the asymptotic formula πu(x, q, a) = δ(u, q, a)x/ log x+O(x/ log x), where δ(u, q, a) > 0 is the density, and b > c+ 1 is a constant.
File Format	PDF HTM / HTML
Alternate Webpage(s)	http://arxiv-export-lb.library.cornell.edu/pdf/1701.03188
Language	English
Access Restriction	Open
Content Type	Text
Resource Type	Article