Rikki edited untitled.html  about 8 years ago

Commit id: f7b1f750974b58229b341e24e2f83f7441044f0d

deletions | additions      

       

Double-click this text 
The Chinese Remainder Theorem is used in discrete mathematics to find a unique solution up  to start writing.
 a desired modulus. 
The Chinese Remainder Theorem states: If \(m_1\) and \(m_2\) are relatively prime, the the system of congruences \(N\equiv a_1\) (\(mod\) \(m_1\)), \(N\equiv a_2\) (\(mod\) \(m_2\)) has a unique solution \(mod\) \(m_1m_2.\)

From this theorem, we can generalize and say that if \(m_1\) and \(m_2\) are relatively prime, then we can allow \(a_1\) and \(a_2\) be any two integers. There will exist an integer \(N\) that satisfies the expressions above.