On primes in arithmetic progression having a prescribed primitive root
Let \(g\) be an integer which is neither \(-1\) nor a square and let \(\pi_g(x;f,a)\) be the number of primes \(p\equiv a\pmod f\) not exceeding \(x\) and having \(g\) for a primitive root. It was shown by \textit{H. W. Lenstra jun.} [Invent. Math. 42, 201-224 (1977; Zbl 0362.12012)] under GRH that \[ \pi_g(x,f,a)=\delta(a,f,g)x/\log x+O(x\log\log x/\log^2x), \] where \(\delta_g(a,f,g)\) is given as a convergent series and later the author (MPI-preprint 57, 1998, per bib.) represented \(\delta_g(a,f,g)\) as an infinite product. Here an asymptotic formula is obtained for the sum \[ S(x;a,f,g,\varepsilon)\sum_{\substack{ p\leq x\\ p\in P(a,f,g,\varepsilon)}} {\varphi(p-1)\over p-1}, \] where \(\varepsilon=\pm 1\) and \(P(a,f,g,\varepsilon)\) is the set of primes \(p\) satisfying \(p\equiv a\pmod f\), \(({g\over p})=\varepsilon\) and \((p-1,h)=1\), \(h\) being the maximal integer such that \(g\) is a \(h\)-th power. This result is used to deduce (under GRH) from Lenstra's theorem the relation \(\pi_g(x,f,a)=2S(x;a,f,g,-1)+O(x\log\log x/\log^2x)\). The undefined constant \(\beta\) in the statement of Theorem 1 should be understood as the constant \(b\), appearing in the seventh line of the next page.
- Asymptotically exact heuristics for prime divisors of the sequence \(\{a^k+b^k\}^\infty_{k=1}\)
- On a sum involving the prime counting function 1/4(x)
- scientific article; zbMATH DE number 1539356
- scientific article; zbMATH DE number 3959520
- Über die Verteilung einiger Klassen quadratfreier Zahlen, die aus einer gegebenen Anzahl von Primfaktoren zusammengesetzt sind.
- scientific article; zbMATH DE number 4025524
- On the number of prime factors of an integer
- scientific article; zbMATH DE number 30190
- On the Average of the Least Primitive Root Modulo p
- scientific article; zbMATH DE number 65933
- An average result for Artin's conjecture
- Artin's conjecture on the average
- scientific article; zbMATH DE number 1532361 (Why is no real title available?)
- On Artin's Conjecture
- On Artin's conjecture and Euclid's algorithm in global fields
- On Artin's conjecture over function fields
- On Artin's conjecture.
- On the distribution of primitive roots mod p
- The Distribution of Primitive Roots
- The trace of an optimal normal element and low complexity normal bases
- On primes in arithmetic progression having a prescribed primitive root. II
- Asymptotically exact heuristic for (near) primitive roots.
- Double circulant self-dual and LCD codes over Galois rings
- On self-dual negacirculant codes of index two and four
- Artin twin primes
- Complete generalized Fibonacci sequences modulo primes
- Irregular primes with respect to Genocchi numbers and Artin's primitive root conjecture
- Permuting operations on strings and the distribution of their prime numbers
- Absolutely abnormal and continued fraction normal numbers
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- scientific article; zbMATH DE number 2145546 (Why is no real title available?)
- scientific article; zbMATH DE number 2103551 (Why is no real title available?)
- On prime primitive roots
- Uniformly counting primes with a given primitive root and in an arithmetic progression
- Cyclicity of elliptic curves modulo primes in arithmetic progressions
- Hadamard matrices and 1-factorizations of complete graphs
- Primes in arithmetic progressions and nonprimitive roots
- Artin prime producing polynomials
- Character sums for primitive root densities
- Primitive roots modulo a prime as consecutive terms of an arithmetic progression.
- On the average number of elements in a finite field with order or index in a prescribed residue class
- Non primitive roots with a prescribed residue pattern
- Prime divisors of -Genocchi numbers and the ubiquity of Ramanujan-style congruences of level
- Unitriangular factorizations of Chevalley groups.
- On the decimal and octal digits of 1/p
This page was built for publication: On primes in arithmetic progression having a prescribed primitive root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306698)
