The Chinese Remainder Theorem is an ancient result taking its name from the work entitled Suangching by Sun Tsu. It is used to solve a system of linear congruences. In the left-hand column of textfields below fill in the remainders obtained when mod-ing by the relatively prime positive integers in the textfields in the right-hand column. Press the Solve button to find the solution.

If you find a case in which the applet fails to function or gives erroneous results, please send me the values of the remainders and divisors which you entered and the contents of your Java console. My modest goal is to have this applet run reliably and accurately.