and with p and q distinct primes.

Show that:

I've tried various thing but I can't seem to find a contradiction (after assuming 3^(2q) == 1 mod p).

Can anyone point me in the right direction please??

Printable View

- April 10th 2012, 04:12 AMAntSolving a congruence modulo p
and with p and q distinct primes.

Show that:

I've tried various thing but I can't seem to find a contradiction (after assuming 3^(2q) == 1 mod p).

Can anyone point me in the right direction please?? - April 13th 2012, 11:33 PMSylvia104Re: Solving a congruence modulo p
Since quadratic reciprocity gives (where denotes the Legendre symbol). In other words is not a quadratic residue modulo by Euler’s criterion,