Prove or disprove: if a^2=b^2=mod(n) and n is prime then a=b(mod n) or a=-b(mod n).

Printable View

- Feb 1st 2010, 09:44 PMDeepucongruence in integer #2
Prove or disprove: if a^2=b^2=mod(n) and n is prime then a=b(mod n) or a=-b(mod n).

- Feb 2nd 2010, 04:24 AMtonio