Generating least primitive roots mod p over a range of p
If m and n are positive integers each less than 10
^{10}
, the least primitive root mod primes in the interval [m,n] are printed.
Enter m (1 < m < 10
^{10}
):
Enter n (1 < n < 10
^{10}
):
Last modified 3rd September 2002
Return to main page