Primitive roots for every admissible integer base

We prove the infinitude assertion in Artin's primitive root conjecture: for every integer a that is neither −1 nor a square, there are at least $c_a x/(\log x)^2$ primes in $(x,2x)$ with primitive root a, for some $c_a\gt 0$ and every sufficiently large x.