If n is odd and has k distinct prime factors, then the number of roots, x^2 = 1 (mod n), is equal to 2^k.
I wish to go without proving the generalized form x^2 = a (mod n).
How can I prove it directly?
Thanks.
If n is odd and has k distinct prime factors, then the number of roots, x^2 = 1 (mod n), is equal to 2^k.
I wish to go without proving the generalized form x^2 = a (mod n).
How can I prove it directly?
Thanks.