kidzsearch.com > wiki Explore:images videos games

# Chinese remainder theorem

KidzSearch Safe Wikipedia for Kids.

The **Chinese remainder theorem** is a theorem from number theory. It is about congruence. The original form was:

*How many soldiers are there in Han Xin's army? – If you let them parade in rows of 3 soldiers, two soldiers will be left. If you let them parade in rows of 5, 3 will be left, and in rows of 7, 2 will be left.*

The theorem says that many times there will be a solution to this question.

The Chinese remainder theorem is used in cryptography, for example for the RSA algorithm.

## Other websites

- Chinese remainder theorem at cut-the-knot
- "Chinese Remainder Theorem" by Ed Pegg, Jr., The Wolfram Demonstrations Project, 2007