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
4194982701-8
49271221-89
272215-89-17
225429-1777
5221-1777-171
212077-171419
So our multiplicative inverse is -171 mod 419 ≡ 248
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
23977023010
977234211101
23112101-2
1111101-223
So our multiplicative inverse is -2 mod 23 ≡ 21
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
6779900677010
9906771313101
67731325101-2
31351671-213
51772-213-93
723113-93292
2120-93292-677
So our multiplicative inverse is 292 mod 677 ≡ 292
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 ≡ 434 × 49-1 (mod 419) ≡ 434 × 248 (mod 419) ≡ 368 (mod 419)
x ≡ 672 × 977-1 (mod 23) ≡ 672 × 21 (mod 23) ≡ 13 (mod 23)
x ≡ 350 × 990-1 (mod 677) ≡ 350 × 292 (mod 677) ≡ 650 (mod 677)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 419 × 23 × 677 = 6524249
  2. We calculate the numbers M1 to M3
    M1=M/m1=6524249/419=15571,   M2=M/m2=6524249/23=283663,   M3=M/m3=6524249/677=9637
  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
    419155710419010
    155714193768101
    4196861101-6
    6811621-637
    11251-637-191
    212037-191419
    So our multiplicative inverse is -191 mod 419 ≡ 228
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    23283663023010
    28366323123334101
    2345301-5
    43111-56
    3130-56-23
    So our multiplicative inverse is 6 mod 23 ≡ 6
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    67796370677010
    963767714159101
    67715944101-4
    159413361-413
    413615-413-17
    3657113-17132
    5150-17132-677
    So our multiplicative inverse is 132 mod 677 ≡ 132
    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
    =  (368 × 15571 × 228 +
       13 × 283663 × 6 +
       650 × 9637 × 132)   mod 6524249
    = 2447328 (mod 6524249)


    So our answer is 2447328 (mod 6524249).


Verification

So we found that x ≡ 2447328
If this is correct, then the following statements (i.e. the original equations) are true:
49x (mod 419) ≡ 434 (mod 419)
977x (mod 23) ≡ 672 (mod 23)
990x (mod 677) ≡ 350 (mod 677)

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