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
53886053010
886531638101
533811501-1
3815281-13
15817-13-4
87113-47
7170-47-53
So our multiplicative inverse is 7 mod 53 ≡ 7
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
1096114801-1
61481131-12
481339-12-7
139142-79
9421-79-25
41409-25109
So our multiplicative inverse is -25 mod 109 ≡ 84
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
23700023010
700233010101
23102301-2
103311-27
3130-27-23
So our multiplicative inverse is 7 mod 23 ≡ 7
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 ≡ 841 × 886-1 (mod 53) ≡ 841 × 7 (mod 53) ≡ 4 (mod 53)
x ≡ 129 × 61-1 (mod 109) ≡ 129 × 84 (mod 109) ≡ 45 (mod 109)
x ≡ 428 × 700-1 (mod 23) ≡ 428 × 7 (mod 23) ≡ 6 (mod 23)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 53 × 109 × 23 = 132871
  2. We calculate the numbers M1 to M3
    M1=M/m1=132871/53=2507,   M2=M/m2=132871/109=1219,   M3=M/m3=132871/23=5777
  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
    532507053010
    2507534716101
    53163501-3
    165311-310
    5150-310-53
    So our multiplicative inverse is 10 mod 53 ≡ 10
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    10912190109010
    12191091120101
    109205901-5
    209221-511
    9241-511-49
    212011-49109
    So our multiplicative inverse is -49 mod 109 ≡ 60
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    235777023010
    5777232514101
    2345301-5
    43111-56
    3130-56-23
    So our multiplicative inverse is 6 mod 23 ≡ 6
    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
    =  (4 × 2507 × 10 +
       45 × 1219 × 60 +
       6 × 5777 × 6)   mod 132871
    = 12035 (mod 132871)


    So our answer is 12035 (mod 132871).


Verification

So we found that x ≡ 12035
If this is correct, then the following statements (i.e. the original equations) are true:
886x (mod 53) ≡ 841 (mod 53)
61x (mod 109) ≡ 129 (mod 109)
700x (mod 23) ≡ 428 (mod 23)

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