The Chinese Remainder TheoremThe Chinese Remainder Theorem states that for relatively prime m_{1}, m_{2}, ... , there is a unique solution (mod m_{1}m_{2}...) to the system of congruences x = a_{1} (mod m_{1}) For a discussion and some sample problems, see Chinese Remainder Theorem.

Translations of mathematical formulas for web display were created by tex4ht. 