Use the Chinese Remainder Theorem to solve X 3mod(8) x 2mod(9) Use the Chinese R

Question

Use the Chinese Remainder Theorem to solve X 3mod(8) x 2mod(9) Use the Chinese Remainder Theorem to solve x 3mod(8) x 2mod(9) x 7mod(35) Use the Chinese Remainder Theorem to solve x 4mod(21) x 9mod(40) x mod(31) The CRT requires the modulus to be coprime, but the system is sometimes solvable anyway. For the following two systems of congruences prove one cannot be solved and find the solution to the other x 3mod(8) x 2mod(10) x 4mod(8) x 2mod(10)

Explanation / Answer

x= 3mod(8) => 3+8t x= 2mod(9) => 2+9s from first we have possibilities as 3,11,19,27,35,43,51,59.67. of which only 11 satisfies the other congruence. so answer is x= 11mod(72) you are supposed to ask only one question in a single post. kindly post other question in separate posts. have a nice day !!!

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.