Prove or disprove: if a^2=b^2=mod(n) and n is prime then a=b(mod n) or a=-b(mod n).
Last edited by mr fantastic; April 15th 2010 at 03:34 PM. Reason: Edited post title
Follow Math Help Forum on Facebook and Google+
Originally Posted by Deepu Prove or disprove: if a^2=b^2=mod(n) and n is prime then a=b(mod n) or a=-b(mod n). True: , since n is prime. Tonio
View Tag Cloud