Finding np, the least quadratic non-residue (mod p)

We test the first 2048 primes pi to find the least j such that pj(p-1)/2 p-1 (mod p).
Then np=pj.

Enter p (an odd prime):

Last modified 10th September 2002
Return to main page