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
7017340701010
734701133101
7013321801-21
338411-2185
8180-2185-701
So our multiplicative inverse is 85 mod 701 ≡ 85
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
997426214501-2
42614521361-25
14513619-25-7
13691515-7110
9190-7110-997
So our multiplicative inverse is 110 mod 997 ≡ 110
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
969733123601-1
7332363251-14
23625911-14-37
2511234-3778
11332-3778-271
321178-271349
2120-271349-969
So our multiplicative inverse is 349 mod 969 ≡ 349
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 ≡ 489 × 734-1 (mod 701) ≡ 489 × 85 (mod 701) ≡ 206 (mod 701)
x ≡ 26 × 426-1 (mod 997) ≡ 26 × 110 (mod 997) ≡ 866 (mod 997)
x ≡ 24 × 733-1 (mod 969) ≡ 24 × 349 (mod 969) ≡ 624 (mod 969)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 701 × 997 × 969 = 677231193
  2. We calculate the numbers M1 to M3
    M1=M/m1=677231193/701=966093,   M2=M/m2=677231193/997=679269,   M3=M/m3=677231193/969=698897
  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
    7019660930701010
    9660937011378115101
    70111561101-6
    115111051-661
    11521-661-128
    515061-128701
    So our multiplicative inverse is -128 mod 701 ≡ 573
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    9976792690997010
    679269997681312101
    99731236101-3
    31261571-316
    61785-316-131
    751216-131147
    5221-131147-425
    2120147-425997
    So our multiplicative inverse is -425 mod 997 ≡ 572
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    9696988970969010
    698897969721248101
    969248322501-3
    2482251231-34
    22523918-34-39
    2318154-3943
    18533-3943-168
    531243-168211
    3211-168211-379
    2120211-379969
    So our multiplicative inverse is -379 mod 969 ≡ 590
    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
    =  (206 × 966093 × 573 +
       866 × 679269 × 572 +
       624 × 698897 × 590)   mod 677231193
    = 112266057 (mod 677231193)


    So our answer is 112266057 (mod 677231193).


Verification

So we found that x ≡ 112266057
If this is correct, then the following statements (i.e. the original equations) are true:
734x (mod 701) ≡ 489 (mod 701)
426x (mod 997) ≡ 26 (mod 997)
733x (mod 969) ≡ 24 (mod 969)

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