The Chinese Remainder Theorem

The Chinese Remainder Theorem states that for relatively prime m₁, m₂, ... , there is a unique solution (mod m₁m₂...) to the system of congruences

x = a₁ (mod m₁)
x = a₂ (mod m₂)
...

For a discussion and some sample problems, see Chinese Remainder Theorem.

Making Mathematics Home |
Mathematics Projects | Students | Teachers |
Mentors | Parents | Hard Math Café |