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
97114768901-6
147891581-67
8958131-67-13
58311277-1320
312714-1320-33
2746320-33218
4311-33218-251
3130218-251971
So our multiplicative inverse is -251 mod 971 ≡ 720
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
40132717401-1
327744311-15
7431212-15-11
3112275-1127
12715-1127-38
751227-3865
5221-3865-168
212065-168401
So our multiplicative inverse is -168 mod 401 ≡ 233
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
6178760617010
8766171259101
61725929901-2
259992611-25
9961138-25-7
61381235-712
3823115-712-19
23151812-1931
15817-1931-50
871131-5081
7170-5081-617
So our multiplicative inverse is 81 mod 617 ≡ 81
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 ≡ 227 × 147-1 (mod 971) ≡ 227 × 720 (mod 971) ≡ 312 (mod 971)
x ≡ 480 × 327-1 (mod 401) ≡ 480 × 233 (mod 401) ≡ 362 (mod 401)
x ≡ 551 × 876-1 (mod 617) ≡ 551 × 81 (mod 617) ≡ 207 (mod 617)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 971 × 401 × 617 = 240241907
  2. We calculate the numbers M1 to M3
    M1=M/m1=240241907/971=247417,   M2=M/m2=240241907/401=599107,   M3=M/m3=240241907/617=389371
  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
    9712474170971010
    247417971254783101
    971783118801-1
    7831884311-15
    1883162-15-31
    3121515-31470
    2120-31470-971
    So our multiplicative inverse is 470 mod 971 ≡ 470
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    4015991070401010
    599107401149413101
    40113301101-30
    1311121-3031
    11251-3031-185
    212031-185401
    So our multiplicative inverse is -185 mod 401 ≡ 216
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    6173893710617010
    38937161763144101
    6174414101-14
    4414401-14617
    So our multiplicative inverse is -14 mod 617 ≡ 603
    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
    =  (312 × 247417 × 470 +
       362 × 599107 × 216 +
       207 × 389371 × 603)   mod 240241907
    = 75715979 (mod 240241907)


    So our answer is 75715979 (mod 240241907).


Verification

So we found that x ≡ 75715979
If this is correct, then the following statements (i.e. the original equations) are true:
147x (mod 971) ≡ 227 (mod 971)
327x (mod 401) ≡ 480 (mod 401)
876x (mod 617) ≡ 551 (mod 617)

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