In 1957, amateur mathematician Raymond Griffin claimed that 10 is a primitive root for all primes produced by the polynomial 10n2 + 7. In this talk we discuss the works of Lehmer (1963) and Moree (2007) related to this claim and explain the relation of such problems with Artin’s primitive root conjecture. We describe an algorithm that produces an integer g and a prime producing polynomial f(n) such that g is a primitive root for a very large proportion of primes produced by f(n). We also present some results we obtained in a joint work with Keilan Scholten (University of Lethbridge).