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:
“In order to be somebody you have to hold even your shadow in high regard.”
—Friedrich Nietzsche (1844–1900)
“We quaff the cup of life with eager haste without draining it, instead of which it only overflows the brim—objects press around us, filling the mind with their magnitude and with the throng of desires that wait upon them, so that we have no room for the thoughts of death.”
—William Hazlitt (1778–1830)
“We have as yet had no adequate account of a primitive pine forest.”
—Henry David Thoreau (1817–1862)
“What are the roots that clutch, what branches grow
Out of this stony rubbish?”
—T.S. (Thomas Stearns)