| Go back to previous page
|
| Forum URL:
|
http://www.cut-the-knot.org/cgi-bin/dcforum/forumctk.cgi
|
| Forum Name:
|
This and that
|
| Topic ID:
|
922
|
| Message ID:
|
2
|
#2, RE: proving the Chinese remainder theorem for more than 2
Posted by Otto Murphy on Mar-18-10 at 09:53 PM
In response to message #0
How do you know that s = n_k 1 (mod gcd(lcm(m1, m2, ..., mk)), m_k 1)?
|
|