Primitive roots for every admissible integer base

Proves the infinitude assertion in Artin's primitive root conjecture for every integer a that is neither −1 nor a square. For each such base, at least $c_a x/(\log x)^2$ primes in every sufficiently large interval $(x,2x)$ have primitive root a, with $c_a\gt 0$.