Bootstrap
  C.R.T. .com
It doesn't have to be difficult if someone just explains it right.

Welcome to ChineseRemainderTheorem.com!

×

Modal Header

Some text in the Modal Body

Some other text...

Use the calculator below to get a step-by-step calculation of the Chinese Remainder Theory. Just enter the numbers you would like and press "Calculate" .


This removes all numbers from the textboxes, such that you can fill in your own.

This fills all textboxes with random numbers. If you fill in random numbers yourself, it is very likely that those numbers do not have a solution. To avoid disappointment, use this button instead! It only uses random numbers that do have a solution.

This button is similar to the "Clear everything" button, but only clears the left column.
This is useful if you want your equations to be of the form x ≡ a (mod m) rather than bx ≡ a (mod m).
In that case, it can be especially useful after using the random numbers button.

Do you want to use more equations? Go ahead and use this button. It adds another row that you can fill in. Not sure what numbers to put in this newly added row? Use the random numbers button again!

Do you have too many rows? Use one of these buttons to remove a row. You can always add a row again using the yellow "Add a row" button.

Are you ready to view a full step-by-step Chinese Remainder Theorem calculation for the numbers you have entered? Then use this button!

Want to know more?


Transform the equations

You used one or more of the fields on the left, so your equations are of the form bx ≡ a mod m.
We want them to be of the form x ≡ a mod m, so we need to move the values on the left to the right side of the equation.
For a more detailed explanation about how this works, see this part of our page about how to execute the Chinese Remainder algorithm.

First, we calculate the inverses of the leftmost value on each row:

nbqr t1t2t3
42134018101-1
340814161-15
811651-15-26
1611605-26421
So our multiplicative inverse is -26 mod 421 ≡ 395
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
49942217701-1
422775371-16
773723-16-13
3731216-13162
3130-13162-499
So our multiplicative inverse is 162 mod 499 ≡ 162
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
6296396201-9
6362111-910
621620-910-629
So our multiplicative inverse is 10 mod 629 ≡ 10
Source: ExtendedEuclideanAlgorithm.com

Click on any row to reveal a more detailed calculation of each multiplicative inverse.

Now that we now the inverses, let's move the leftmost value on each row to the right of the equation:

x ≡ 444 × 340-1 (mod 421) ≡ 444 × 395 (mod 421) ≡ 244 (mod 421)
x ≡ 256 × 422-1 (mod 499) ≡ 256 × 162 (mod 499) ≡ 55 (mod 499)
x ≡ 724 × 63-1 (mod 629) ≡ 724 × 10 (mod 629) ≡ 321 (mod 629)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 421 × 499 × 629 = 132139691
  2. We calculate the numbers M1 to M3
    M1=M/m1=132139691/421=313871,   M2=M/m2=132139691/499=264809,   M3=M/m3=132139691/629=210079
  3. We now calculate the modular multiplicative inverses M1-1 to M3-1
    Have a look at the page that explains how to calculate modular multiplicative inverse.
    Using, for example, the Extended Euclidean Algorithm, we will find that:

    nbqr t1t2t3
    4213138710421010
    313871421745226101
    421226119501-1
    2261951311-12
    1953169-12-13
    319342-1341
    9421-1341-95
    414041-95421
    So our multiplicative inverse is -95 mod 421 ≡ 326
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    4992648090499010
    264809499530339101
    499339116001-1
    3391602191-13
    1601988-13-25
    198233-2553
    8322-2553-131
    321153-131184
    2120-131184-499
    So our multiplicative inverse is 184 mod 499 ≡ 184
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    6292100790629010
    210079629333622101
    6296221701-1
    62278861-189
    7611-189-90
    616089-90629
    So our multiplicative inverse is -90 mod 629 ≡ 539
    Source: ExtendedEuclideanAlgorithm.com
  4. Now we can calculate x with the equation we saw earlier
    x = (a1 × M1 × M1-1   +   a2 × M2 × M2-1   + ... +   ak × Mk × Mk-1)   mod M
    =  (244 × 313871 × 326 +
       55 × 264809 × 184 +
       321 × 210079 × 539)   mod 132139691
    = 38469961 (mod 132139691)


    So our answer is 38469961 (mod 132139691).


Verification

So we found that x ≡ 38469961
If this is correct, then the following statements (i.e. the original equations) are true:
340x (mod 421) ≡ 444 (mod 421)
422x (mod 499) ≡ 256 (mod 499)
63x (mod 629) ≡ 724 (mod 629)

Let's see whether that's indeed the case if we use x ≡ 38469961.