Let m be within integers and with m>2, If a primitive root modulo m exists, prove that the only incongruent solutions of the congruence x^2 ≡1mod(m)are x ≡1mod(m) and x ≡-1mod(m)

Printable View

- Nov 22nd 2008, 08:53 AMbigbnumber thoery
Let m be within integers and with m>2, If a primitive root modulo m exists, prove that the only incongruent solutions of the congruence x^2 ≡1mod(m)are x ≡1mod(m) and x ≡-1mod(m)

- Nov 22nd 2008, 03:59 PMThePerfectHacker