Chinese remainder theorem: Difference between revisions
Jump to navigation
Jump to search
imported>Barry R. Smith (Created stub) |
(No difference)
|
Revision as of 11:26, 18 November 2008
The Chinese remainder theorem is a mathematical result about modular arithmetic. It describes the solutions to a system of linear congruences with distinct moduli. As well as being a fundamental tool in number theory, the Chinese remainder theorem forms the theoretical basis of algorithms for storing integers and in cryptography. The Chinese remainder theorem can be generalized to a statement about commutative rings; for more about this, see the "advanced" subpage.