Order of Magnitude of Primitive Roots
The least primitive root modulo p is generally small.
Let gp be the smallest primitive root modulo p in the range 1, 2, ..., p–1.
Fridlander (1949) and Salié (1950) proved that there is a positive constant C such that for infinitely many primes gp > C log p.
It can be proved in an elementary manner that for any positive integer M there are infinitely many primes such that M < gp < p – M.
Burgess (1962) proved that for every ε > 0 there is a C such that
Grosswald (1981) proved that if, then .
Shoup (1990, 1992) proved, assuming the generalized Riemann hypothesis, that gp =O(log6 p).
Read more about this topic: Primitive Root Modulo n
Famous quotes containing the words order, magnitude, primitive and/or roots:
“The earlier works of a man of genius are always preferred to the newer ones, in order to prove that he is going down instead of up.”
—Victor Hugo (1802–1885)
“Sometimes you’re overwhelmed when a thing comes, and you do not realize the magnitude of the affair at that moment. When you get away from it, you wonder, did it really happen to you.”
—Marian Anderson (1902–1993)
“[How] the young . . . can grow from the primitive to the civilized, from emotional anarchy to the disciplined freedom of maturity without losing the joy of spontaneity and the peace of self-honesty is a problem of education that no school and no culture have ever solved.”
—Leontine Young (20th century)
“Sensuality often accelerates the growth of love so much that its roots remain weak and are easily pulled up.”
—Friedrich Nietzsche (1844–1900)