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
57968057010
968571656101
57561101-1
5615601-157
So our multiplicative inverse is -1 mod 57 ≡ 56
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
5478130547010
8135471266101
54726621501-2
2661517111-235
151114-235-37
1142335-37109
4311-37109-146
3130109-146547
So our multiplicative inverse is -146 mod 547 ≡ 401
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
1018460101010
846101838101
1013822501-2
38251131-23
2513112-23-5
1312113-58
121120-58-101
So our multiplicative inverse is 8 mod 101 ≡ 8
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 ≡ 655 × 968-1 (mod 57) ≡ 655 × 56 (mod 57) ≡ 29 (mod 57)
x ≡ 227 × 813-1 (mod 547) ≡ 227 × 401 (mod 547) ≡ 225 (mod 547)
x ≡ 461 × 846-1 (mod 101) ≡ 461 × 8 (mod 101) ≡ 52 (mod 101)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 57 × 547 × 101 = 3149079
  2. We calculate the numbers M1 to M3
    M1=M/m1=3149079/57=55247,   M2=M/m2=3149079/547=5757,   M3=M/m3=3149079/101=31179
  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
    5755247057010
    552475796914101
    57144101-4
    1411401-457
    So our multiplicative inverse is -4 mod 57 ≡ 53
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    54757570547010
    575754710287101
    547287126001-1
    2872601271-12
    26027917-12-19
    27171102-1921
    171017-1921-40
    1071321-4061
    7321-4061-162
    313061-162547
    So our multiplicative inverse is -162 mod 547 ≡ 385
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    101311790101010
    3117910130871101
    1017113001-1
    71302111-13
    301128-13-7
    118133-710
    8322-710-27
    321110-2737
    2120-2737-101
    So our multiplicative inverse is 37 mod 101 ≡ 37
    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
    =  (29 × 55247 × 53 +
       225 × 5757 × 385 +
       52 × 31179 × 37)   mod 3149079
    = 1191044 (mod 3149079)


    So our answer is 1191044 (mod 3149079).


Verification

So we found that x ≡ 1191044
If this is correct, then the following statements (i.e. the original equations) are true:
968x (mod 57) ≡ 655 (mod 57)
813x (mod 547) ≡ 227 (mod 547)
846x (mod 101) ≡ 461 (mod 101)

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