Kids Search. The Best Search Engine for K-12 Kids and Children.     

   web | images | video | facts | wiki | news | games | kidztube | apps

report a search problem

contact us education daily journal home facebook
about us make us your default search kidztalk twitter  
terms/privacy blocking websites kidznet pinterest  
advertise teacher zone wiki    
media link to us learning sites    
business / api solutions add a site image search    
affiliate program kidzsearch apps kidztube    
play youtube on kidzsearch games    
  voice search music    
  report a problem cool facts    
  settings news    
    search help    
    kidznet directory    

 mobile version

      Copyright 2005-2021 

The chinese remainder theorem is a theorem from number theory. It is about congruence. The original form was:

How many soldiers are there in Han Xin's army? – If you let them parade in rows of 3 soldiers, two soldiers will be left. If you let them parade in rows of 5, 3 will be left, and in rows of 7, 2 will be left.

The theorem says that there will be a solution to this question if there's no common factor between the row sizes. Using the original example, that is that no number divides both 3 and 7, both 3 and 5, nor both 5 and 7 (except, of course, 1). They're all coprime.

The Chinese remainder theorem is used in cryptography. For example, for the RSA algorithmview more...