Chinese Remainder Theorem
Library Home || Full Table of Contents || Suggest a Link || Library Help
|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 (9-12), College|
|Math Topics:||Basic Algebra, Basic Operations, History and Biography, Number Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.