Tuesday, 15 March 2016

elementary number theory - Chinese Remainder Theorem and linear congruences

I have found the following congruences:




  1. $x \equiv 2\mod 5$

  2. $x \equiv 12\mod27$

  3. $x \equiv 2\mod4$



How can I solve for x using the Chinese Remainder Theorem? Please include justifications for the steps you take.




How can I find $x$?

No comments:

Post a Comment