Finding n
p
, the least quadratic non-residue (mod p)
We test the first 2048 primes p
i
to find the least j such that p
j
(p-1)/2
p-1 (mod p).
Then n
p
=p
j
.
Enter p (an odd prime):
Last modified 10th September 2002
Return to main page