Generating negative least primitive roots mod p over a range of p

If m and n are positive integers each less than 1010, the least negative primitive root mod primes in the interval [m,n] are printed.

Enter m (1 < m < 1010 ):
Enter n (1 < n < 1010 ):

Last modified 3rd September 2002
Return to main page