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
57111511001-51
1110111-5152
101100-5152-571
So our multiplicative inverse is 52 mod 571 ≡ 52
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
88120147701-4
201772471-49
7747130-49-13
47301179-1322
3017113-1322-35
17131422-3557
13431-3557-206
414057-206881
So our multiplicative inverse is -206 mod 881 ≡ 675
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
2294450229010
4452291216101
22921611301-1
216131681-117
13815-117-18
851317-1835
5312-1835-53
321135-5388
2120-5388-229
So our multiplicative inverse is 88 mod 229 ≡ 88
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 ≡ 915 × 11-1 (mod 571) ≡ 915 × 52 (mod 571) ≡ 187 (mod 571)
x ≡ 831 × 201-1 (mod 881) ≡ 831 × 675 (mod 881) ≡ 609 (mod 881)
x ≡ 84 × 445-1 (mod 229) ≡ 84 × 88 (mod 229) ≡ 64 (mod 229)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 571 × 881 × 229 = 115198679
  2. We calculate the numbers M1 to M3
    M1=M/m1=115198679/571=201749,   M2=M/m2=115198679/881=130759,   M3=M/m3=115198679/229=503051
  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
    5712017490571010
    201749571353186101
    57118631301-3
    186131441-343
    13431-343-132
    414043-132571
    So our multiplicative inverse is -132 mod 571 ≡ 439
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    8811307590881010
    130759881148371101
    881371213901-2
    3711392931-25
    13993146-25-7
    9346215-719
    461460-719-881
    So our multiplicative inverse is 19 mod 881 ≡ 19
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    2295030510229010
    5030512292196167101
    22916716201-1
    167622431-13
    6243119-13-4
    4319253-411
    19534-411-37
    541111-3748
    4140-3748-229
    So our multiplicative inverse is 48 mod 229 ≡ 48
    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
    =  (187 × 201749 × 439 +
       609 × 130759 × 19 +
       64 × 503051 × 48)   mod 115198679
    = 36790288 (mod 115198679)


    So our answer is 36790288 (mod 115198679).


Verification

So we found that x ≡ 36790288
If this is correct, then the following statements (i.e. the original equations) are true:
11x (mod 571) ≡ 915 (mod 571)
201x (mod 881) ≡ 831 (mod 881)
445x (mod 229) ≡ 84 (mod 229)

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