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
2179620217010
962217494101
2179422901-2
9429371-27
29741-27-30
71707-30217
So our multiplicative inverse is -30 mod 217 ≡ 187
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
4796075901-7
6059111-78
591590-78-479
So our multiplicative inverse is 8 mod 479 ≡ 8
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
60156413701-1
564371591-116
37941-116-65
919016-65601
So our multiplicative inverse is -65 mod 601 ≡ 536
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 ≡ 79 × 962-1 (mod 217) ≡ 79 × 187 (mod 217) ≡ 17 (mod 217)
x ≡ 109 × 60-1 (mod 479) ≡ 109 × 8 (mod 479) ≡ 393 (mod 479)
x ≡ 574 × 564-1 (mod 601) ≡ 574 × 536 (mod 601) ≡ 553 (mod 601)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 217 × 479 × 601 = 62469743
  2. We calculate the numbers M1 to M3
    M1=M/m1=62469743/217=287879,   M2=M/m2=62469743/479=130417,   M3=M/m3=62469743/601=103943
  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
    2172878790217010
    2878792171326137101
    21713718001-1
    137801571-12
    8057123-12-3
    57232112-38
    231121-38-19
    1111108-19217
    So our multiplicative inverse is -19 mod 217 ≡ 198
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    4791304170479010
    130417479272129101
    47912939201-3
    129921371-34
    9237218-34-11
    3718214-1126
    181180-1126-479
    So our multiplicative inverse is 26 mod 479 ≡ 26
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    6011039430601010
    103943601172571101
    60157113001-1
    571301911-120
    301300-120-601
    So our multiplicative inverse is 20 mod 601 ≡ 20
    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
    =  (17 × 287879 × 198 +
       393 × 130417 × 26 +
       553 × 103943 × 20)   mod 62469743
    = 15375335 (mod 62469743)


    So our answer is 15375335 (mod 62469743).


Verification

So we found that x ≡ 15375335
If this is correct, then the following statements (i.e. the original equations) are true:
962x (mod 217) ≡ 79 (mod 217)
60x (mod 479) ≡ 109 (mod 479)
564x (mod 601) ≡ 574 (mod 601)

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