Location via proxy:
[ UP ]
[Report a bug]
[Manage cookies]
No cookies
No scripts
No ads
No referrer
Show this form
Finding the least primitive root (mod p), p an odd prime
This uses the
factorisation
of p-1 and works for p with less than 20 or so digits.
See
lecture notes
.
Enter p (an odd prime):
Last modified 6th April 2004
Return to main page