Theorem

The congruence $ax\equiv b\pmod{m}$ where $d=gcd(a,m)$ and $d|b$ has a solution $$x\equiv a_{1}^{-1}b_{1}\pmod{m/d}$$where $a_{1}=\frac{a}{d},b_{1}=\frac{b}{d}$.