The Chinese remainder theorem

We solve the congruences x a (mod m), x b (mod n). (See description of algorithm.)

Enter a:
Enter b:
Enter m (> 1):
Enter n (> 1):

Last modified 23rd May 2003
Return to main page