# Math Help - Chinese remainder theorem problem

1. ## Chinese remainder theorem problem

$\begin{cases} x \equiv 39 \pmod{189}\\ x \equiv 25 \pmod{539}\\ x \equiv 39 \pmod{1089}\end{cases}$

but two moduli are not pairwise prime $(189, 1089)=3$
What do we do to solve it then? Should we write prime decomposition for these moduli and calculate it separately?

Thanks

2. ## Re: Chinese remainder theorem problem

I have solve it.