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:
“This entire most beautiful order of good things is going to pass away after its measure has been exhausted; for both morning and evening were made in them.”
—St. Augustine (354–430)
“Although a man may lose a sense of his own importance when he is a mere unit among a busy throng, all utterly regardless of him, it by no means follows that he can dispossess himself, with equal facility, of a very strong sense of the importance and magnitude of his cares.”
—Charles Dickens (1812–1870)
“Good music is very close to primitive language.”
—Denis Diderot (1713–1784)
“To the young mind, every thing is individual, stands by itself. By and by, it finds how to join two things, and see in them one nature; then three, then three thousand; and so, tyrannized over by its own unifying instinct, it goes on tying things together, diminishing anomalies, discovering roots running underground, whereby contrary and remote things cohere, and flower out from one stem.”
—Ralph Waldo Emerson (1803–1882)