How do I verify that if $a \equiv b\pmod{n_1}$ and $a \equiv b\pmod{n_2}$, then $a \equiv b \pmod n$, where the integer $n = \operatorname{lcm} (n_1, n_2)$. Hence, whenever $n_1$ & $n_2$ are relatively prime, $a \equiv b \pmod{n_1 n_2}$

  • $\begingroup$ So suppose $p^r$ is the highest power of $p$ dividing $n_1,n_2$. What does $a=b\bmod n_1$ and $a=b\bmod n_2$ tell you? $\endgroup$ – almagest Apr 12 '16 at 16:20
  • $\begingroup$ Notice the use of \pmod and \operatorname in my edit to the question. $\qquad$ $\endgroup$ – Michael Hardy Apr 12 '16 at 16:23

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.