jacquelinek
- 3
- 0
I know that 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.
However, I don't know how to give a formal proof to it.
I simply want to bypass the generalized form x^2 = a (mod n).
How can I prove it directly?
Thank you.
However, I don't know how to give a formal proof to it.
I simply want to bypass the generalized form x^2 = a (mod n).
How can I prove it directly?
Thank you.