About | Help  
  
 
WebsterComputerMath
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
 
CaCbCcCdCeCfCgChCiCjCkClCmCnCoCpCqCrCsCtCuCvCwCxCyCz
 

CHINESE REMAINDER THEOREM

Chinese Remainder Theorem - Let m1, ..., mk be relatively prime positive integers, and let b1, ..., bk be any integers. Then, there exists x such that

x equiv b1 (mod m1)
...
x equiv bk (mod mk)
and x is uniquely determined by m1...mk.