0
$\begingroup$

Can I find the solutions, or number of solutions for $$ a^2 \equiv 1\ (mod\ m) $$ where m is not necessarily prime?

$\endgroup$
  • 1
    $\begingroup$ Welcome to MSE. Did you mean $a^2\equiv1\pmod m$? $\endgroup$ – José Carlos Santos Oct 15 at 6:41
  • $\begingroup$ @JoséCarlosSantos Yes I did... thank you very much. $\endgroup$ – October15 Oct 15 at 6:43
  • 3
    $\begingroup$ Using Chinese Remainder Theorem reduces the problem to prime power $m$. $\endgroup$ – Lord Shark the Unknown Oct 15 at 6:46
  • $\begingroup$ @LordSharktheUnknown Got it. Thank you! $\endgroup$ – October15 Oct 15 at 6:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.