Chinese Remainder Thoerem - Is it possible to solve a system of congruences that are not coprime?

40 Views Asked by At

$x \equiv 1\mod3$
$x \equiv 2\mod 9$
Is it possible to solve this system of congruences?

1

There are 1 best solutions below

2
On

$x\equiv 2 \bmod 9\implies x\equiv 2 \bmod 3$

in general $x\equiv a \bmod nk \implies x \equiv a \bmod n$