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
6619580661010
9586611297101
66129726701-2
297674291-29
672929-29-20
299329-2069
9241-2069-296
212069-296661
So our multiplicative inverse is -296 mod 661 ≡ 365
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
2596040259010
604259286101
259863101-3
8618601-3259
So our multiplicative inverse is -3 mod 259 ≡ 256
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
82174417701-1
744779511-110
7751126-110-11
512612510-1121
262511-1121-32
25125021-32821
So our multiplicative inverse is -32 mod 821 ≡ 789
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 ≡ 260 × 958-1 (mod 661) ≡ 260 × 365 (mod 661) ≡ 377 (mod 661)
x ≡ 605 × 604-1 (mod 259) ≡ 605 × 256 (mod 259) ≡ 257 (mod 259)
x ≡ 750 × 744-1 (mod 821) ≡ 750 × 789 (mod 821) ≡ 630 (mod 821)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 661 × 259 × 821 = 140554379
  2. We calculate the numbers M1 to M3
    M1=M/m1=140554379/661=212639,   M2=M/m2=140554379/259=542681,   M3=M/m3=140554379/821=171199
  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
    6612126390661010
    212639661321458101
    661458120301-1
    4582032521-13
    20352347-13-10
    5247153-1013
    47592-1013-127
    522113-127267
    2120-127267-661
    So our multiplicative inverse is 267 mod 661 ≡ 267
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    2595426810259010
    542681259209576101
    2597633101-3
    76312141-37
    311423-37-17
    143427-1775
    3211-1775-92
    212075-92259
    So our multiplicative inverse is -92 mod 259 ≡ 167
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    8211711990821010
    171199821208431101
    821431139001-1
    4313901411-12
    39041921-12-19
    41211202-1921
    212011-1921-40
    20120021-40821
    So our multiplicative inverse is -40 mod 821 ≡ 781
    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
    =  (377 × 212639 × 267 +
       257 × 542681 × 167 +
       630 × 171199 × 781)   mod 140554379
    = 42033367 (mod 140554379)


    So our answer is 42033367 (mod 140554379).


Verification

So we found that x ≡ 42033367
If this is correct, then the following statements (i.e. the original equations) are true:
958x (mod 661) ≡ 260 (mod 661)
604x (mod 259) ≡ 605 (mod 259)
744x (mod 821) ≡ 750 (mod 821)

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