Chinese remainder theorem

The system of linear congruences

x = a_i mod m_i,  i = 1, 2, ..., k,
in which gcd(m_i,m_j) = 1 for all distinct i and j, has a unique solution modulo the product m₁ m₂ ··· m_k.