Primitive Root Modulo n - Order of Magnitude of Primitive Roots

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:

    “We are born into them, marry into them, even create them among the people we love. They come large and extended...or small and nuclear. But whatever their size or wherever they live, strong families give us the nurturance and strength we need in order to survive.”
    —Andrea Davis (20th century)

    “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)

    “A good word is as a good tree—
    its roots are firm,
    and its branches are in heaven;
    it gives its produce every season
    by the leave of its Lord.”
    —Qur’An. Abraham 14:29-30, ed. Arthur J. Arberry (1955)