# Chinese Remainder Theorem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

For a parade, marchers are arranged in columns of seven, but one person is left out. In columns of eight, two people are left out. With columns of nine, three people are left out. How many marchers are there? The given data is , , and . Since the moduli are relatively prime, the Chinese remainder theorem can be used to find the unique possible number of marchers between and . There are 498 marchers.

Contributed by: Ed Pegg Jr (March 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

detailSectionParagraph## Permanent Citation

"Chinese Remainder Theorem"

http://demonstrations.wolfram.com/ChineseRemainderTheorem/

Wolfram Demonstrations Project

Published: March 7 2011