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
61713149301-4
131931381-45
9338217-45-14
3817245-1433
17441-1433-146
414033-146617
So our multiplicative inverse is -146 mod 617 ≡ 471
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
1818970181010
8971814173101
1811731801-1
17382151-122
8513-122-23
531222-2345
3211-2345-68
212045-68181
So our multiplicative inverse is -68 mod 181 ≡ 113
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
355178117701-1
178177111-12
17711770-12-355
So our multiplicative inverse is 2 mod 355 ≡ 2
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 ≡ 5 × 131-1 (mod 617) ≡ 5 × 471 (mod 617) ≡ 504 (mod 617)
x ≡ 797 × 897-1 (mod 181) ≡ 797 × 113 (mod 181) ≡ 104 (mod 181)
x ≡ 738 × 178-1 (mod 355) ≡ 738 × 2 (mod 355) ≡ 56 (mod 355)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 617 × 181 × 355 = 39645335
  2. We calculate the numbers M1 to M3
    M1=M/m1=39645335/617=64255,   M2=M/m2=39645335/181=219035,   M3=M/m3=39645335/355=111677
  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
    617642550617010
    6425561710487101
    617877801-7
    8781071-771
    8711-771-78
    717071-78617
    So our multiplicative inverse is -78 mod 617 ≡ 539
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    1812190350181010
    219035181121025101
    181257601-7
    256411-729
    6160-729-181
    So our multiplicative inverse is 29 mod 181 ≡ 29
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    3551116770355010
    111677355314207101
    355207114801-1
    2071481591-12
    14859230-12-5
    59301292-57
    302911-57-12
    2912907-12355
    So our multiplicative inverse is -12 mod 355 ≡ 343
    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
    =  (504 × 64255 × 539 +
       104 × 219035 × 29 +
       56 × 111677 × 343)   mod 39645335
    = 2191471 (mod 39645335)


    So our answer is 2191471 (mod 39645335).


Verification

So we found that x ≡ 2191471
If this is correct, then the following statements (i.e. the original equations) are true:
131x (mod 617) ≡ 5 (mod 617)
897x (mod 181) ≡ 797 (mod 181)
178x (mod 355) ≡ 738 (mod 355)

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