Primitive root modulo n - Wikipedia, the free encyclopedia - 0 views
-
Fridlander (1949) and Salié (1950) proved[5] that that there is a constant C such that for infinitely many primes gp > C log p.
-
Shoup (1990, 1992) proved,[9] assuming the generalized Riemann hypothesis, that gp =O(log6 p).
