1 result.
-
Question in Content created by Newcastle University by
Newcastle University Mathematics and Statistics
Solving three simultaneous congruences using the Chinese Remainder Theorem:
\begin{eqnarray*} x\;&\equiv&\;b_1\;&\mod&\;n_1\\ x\;&\equiv&\;b_2\;&\mod&\;n_2\\x\;&\equiv&\;b_3\;&\mod&\;n_3 \end{eqnarray*} where \operatorname{gcd}(n_1,n_2,n_3)=1