Chinese Remainder Theorem
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://www.cuttheknot.org/blue/chinese.shtml  


Interactive Mathematics Miscellany and Puzzles, Alexander Bogomolny  
An explanation and proof, using modular arithmetic, of the Chinese Remainder Theorem, which concerns problems of the following type: There are certain things whose number is unknown. Repeatedly divided by 3, the remainder is 2; by 5 the remainder is 3; and by 7 the remainder is 2. What will be the number?  


Levels:  High School (912), College 
Languages:  English 
Resource Types:  Articles 
Math Topics:  Basic Algebra, Basic Operations, History and Biography, Number Theory 
[Privacy Policy] [Terms of Use]
© 1994 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.