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
977202416901-4
2021691331-45
1693354-45-29
334815-29237
4140-29237-977
So our multiplicative inverse is 237 mod 977 ≡ 237
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
709143413701-4
143137161-45
1376225-45-114
65115-114119
5150-114119-709
So our multiplicative inverse is 119 mod 709 ≡ 119
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
1537510153010
7511534139101
15313911401-1
139149131-110
141311-110-11
13113010-11153
So our multiplicative inverse is -11 mod 153 ≡ 142
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 ≡ 706 × 202-1 (mod 977) ≡ 706 × 237 (mod 977) ≡ 255 (mod 977)
x ≡ 943 × 143-1 (mod 709) ≡ 943 × 119 (mod 709) ≡ 195 (mod 709)
x ≡ 923 × 751-1 (mod 153) ≡ 923 × 142 (mod 153) ≡ 98 (mod 153)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 977 × 709 × 153 = 105982029
  2. We calculate the numbers M1 to M3
    M1=M/m1=105982029/977=108477,   M2=M/m2=105982029/709=149481,   M3=M/m3=105982029/153=692693
  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
    9771084770977010
    10847797711130101
    97730321701-32
    30171131-3233
    171314-3233-65
    1343133-65228
    4140-65228-977
    So our multiplicative inverse is 228 mod 977 ≡ 228
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    7091494810709010
    149481709210591101
    709591111801-1
    591118511-16
    11811180-16-709
    So our multiplicative inverse is 6 mod 709 ≡ 6
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    1536926930153010
    692693153452762101
    1536222901-2
    6229241-25
    29471-25-37
    41405-37153
    So our multiplicative inverse is -37 mod 153 ≡ 116
    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
    =  (255 × 108477 × 228 +
       195 × 149481 × 6 +
       98 × 692693 × 116)   mod 105982029
    = 48705659 (mod 105982029)


    So our answer is 48705659 (mod 105982029).


Verification

So we found that x ≡ 48705659
If this is correct, then the following statements (i.e. the original equations) are true:
202x (mod 977) ≡ 706 (mod 977)
143x (mod 709) ≡ 943 (mod 709)
751x (mod 153) ≡ 923 (mod 153)

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