On primes in arithmetic progression having a prescribed primitive root. II (Q1038630)

Let \(g\neq-1\) be a non-square integer. It was shown by \textit{H. W. Lenstra, Jr.} [Invent. Math. 42, 201--224 (1977; Zbl 0362.12012)] that under GRH the set of primes \(p\equiv a\) mod \(f\) (where \((a,f)=1\)) for which \(g\) is a primitive root has a density \(\delta(a,f,g)\), for which he gave a formula involving automorphisms of algebraic number fields. The author presents a formula (Th.1.2) for this density in which only elementary functions (the Möbius function and Kronecker's symbol) appear, and shows that his formula leads to a simple determination of cases when \(\delta(a,f,g)\) vanishes. Also a conjecture of \textit{F. Rodier} [Discrete Math. 149, No. 1--3, 205--221 (1996; Zbl 0846.94020)], related to coding theory, is shown to be incompatible with GRH, and finally a description (under GRH) is given for integers \(f\) for which the sequence of primes having \(g\) for a primitive root is weakly uniformly distributed mod \(f\) (the last result was first established by the author earlier [Acta Arith. 89, No. 1, 9--21 (1999; Zbl 0926.11003)] with a more involved proof). For Part I, cf. [J. Number Theory 78, No. 1, 85--98 (1999; Zbl 0931.11036)].