Question

How would I apply Chinese remainder theorem to this?
x is congruent to 7 in mod 20, x is congruent to 7 in mod 12.
How to make 20 and 12 coprime in this case? Or is it not possible to fit the problem into Chinese remainder theorem?

Answer 1

\(x \equiv 7 \pmod{20}\) \(x \equiv 7 \pmod{12}\)

Answer 2

(I understand that the answer is see through, but I am interested in what to do when gcd(a, b) isn't 1)

Answer 3

20 and 12 arn;t coprive they are devisible by 4