Encyclopedia > Talk:Linear congruence theorem

  Article Content

Talk:Linear congruence theorem

Sorry to make something that seems easy a bit more confusing, but the steps taken to solve the system of congruences (the steps are known as the Chinese remainder theorem, by the way) only work if the bases (numbers being used as mod's) are relatively prime. In the example mod 4 and mod 6 are both used. Both these have a HCF of 2, not one, so they are not relatively prime. They can be decomposed into relatively prime congruences, but I'm not sure how to do that (I was searching for a way to do it when I stumbled across this page)



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
1904

... - Wilson Barrett, actor August 22 - Kate Chopin, author August 25 - Henri Fantin-Latour, painter August 29 - Murat V, deposed Ottoman sultan September 26 - John F. ...

 
 
 
This page was created in 30.4 ms