Show that the congruence x^2≡1 (mod 2^k) has exactly four incongruent solutions, namely x≡(+-)1 or (+-)(1+2^(k-1)) (mod 2^k), when k>2. Show that when k=1 there is one solution and that when k=2 there are two incongruent solutions.
Follow Math Help Forum on Facebook and Google+
http://www.mathhelpforum.com/math-he...2-b-71803.html
View Tag Cloud