Let m be an integer with m >2. If a primitive root modulo m exists, prove that the only incongruent solutions of the congruence x^2=1 mod m are x=1 mod m and x= -1 mod m.

Printable View

- November 28th 2008, 08:42 AMmndi1105Primitive Root Theorem
Let m be an integer with m >2. If a primitive root modulo m exists, prove that the only incongruent solutions of the congruence x^2=1 mod m are x=1 mod m and x= -1 mod m.

- November 28th 2008, 09:27 AMThePerfectHacker