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
4614750461010
475461114101
46114321301-32
1413111-3233
131130-3233-461
So our multiplicative inverse is 33 mod 461 ≡ 33
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
757483127401-1
48327412091-12
274209165-12-3
209653142-311
651449-311-47
1491511-4758
9514-4758-105
541158-105163
4140-105163-757
So our multiplicative inverse is 163 mod 757 ≡ 163
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
875673120201-1
6732023671-14
2026731-14-13
6716704-13875
So our multiplicative inverse is -13 mod 875 ≡ 862
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 ≡ 995 × 475-1 (mod 461) ≡ 995 × 33 (mod 461) ≡ 104 (mod 461)
x ≡ 261 × 483-1 (mod 757) ≡ 261 × 163 (mod 757) ≡ 151 (mod 757)
x ≡ 54 × 673-1 (mod 875) ≡ 54 × 862 (mod 875) ≡ 173 (mod 875)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 461 × 757 × 875 = 305354875
  2. We calculate the numbers M1 to M3
    M1=M/m1=305354875/461=662375,   M2=M/m2=305354875/757=403375,   M3=M/m3=305354875/875=348977
  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
    4616623750461010
    6623754611436379101
    46137918201-1
    379824511-15
    8251131-15-6
    51311205-611
    3120111-611-17
    20111911-1728
    11912-1728-45
    924128-45208
    2120-45208-461
    So our multiplicative inverse is 208 mod 461 ≡ 208
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    7574033750757010
    403375757532651101
    757651110601-1
    6511066151-17
    1061571-17-50
    1511507-50757
    So our multiplicative inverse is -50 mod 757 ≡ 707
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    8753489770875010
    348977875398727101
    875727114801-1
    72714841351-15
    148135113-15-6
    135131055-665
    13523-665-136
    531265-136201
    3211-136201-337
    2120201-337875
    So our multiplicative inverse is -337 mod 875 ≡ 538
    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
    =  (104 × 662375 × 208 +
       151 × 403375 × 707 +
       173 × 348977 × 538)   mod 305354875
    = 97952923 (mod 305354875)


    So our answer is 97952923 (mod 305354875).


Verification

So we found that x ≡ 97952923
If this is correct, then the following statements (i.e. the original equations) are true:
475x (mod 461) ≡ 995 (mod 461)
483x (mod 757) ≡ 261 (mod 757)
673x (mod 875) ≡ 54 (mod 875)

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