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
941105810101-8
105101141-89
1014251-89-233
41409-233941
So our multiplicative inverse is -233 mod 941 ≡ 708
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
6638810663010
8816631218101
6632183901-3
21892421-373
9241-373-295
212073-295663
So our multiplicative inverse is -295 mod 663 ≡ 368
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
85977318601-1
773868851-19
868511-19-10
8518509-10859
So our multiplicative inverse is -10 mod 859 ≡ 849
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 ≡ 473 × 105-1 (mod 941) ≡ 473 × 708 (mod 941) ≡ 829 (mod 941)
x ≡ 100 × 881-1 (mod 663) ≡ 100 × 368 (mod 663) ≡ 335 (mod 663)
x ≡ 355 × 773-1 (mod 859) ≡ 355 × 849 (mod 859) ≡ 745 (mod 859)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 941 × 663 × 859 = 535915497
  2. We calculate the numbers M1 to M3
    M1=M/m1=535915497/941=569517,   M2=M/m2=535915497/663=808319,   M3=M/m3=535915497/859=623883
  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
    9415695170941010
    569517941605212101
    94121249301-4
    212932261-49
    9326315-49-31
    26151119-3140
    151114-3140-71
    1142340-71182
    4311-71182-253
    3130182-253941
    So our multiplicative inverse is -253 mod 941 ≡ 688
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    6638083190663010
    8083196631219122101
    66312255301-5
    122532161-511
    531635-511-38
    1653111-38125
    5150-38125-663
    So our multiplicative inverse is 125 mod 663 ≡ 125
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    8596238830859010
    623883859726249101
    859249311201-3
    2491122251-37
    11225412-37-31
    2512217-3169
    121120-3169-859
    So our multiplicative inverse is 69 mod 859 ≡ 69
    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
    =  (829 × 569517 × 688 +
       335 × 808319 × 125 +
       745 × 623883 × 69)   mod 535915497
    = 61826411 (mod 535915497)


    So our answer is 61826411 (mod 535915497).


Verification

So we found that x ≡ 61826411
If this is correct, then the following statements (i.e. the original equations) are true:
105x (mod 941) ≡ 473 (mod 941)
881x (mod 663) ≡ 100 (mod 663)
773x (mod 859) ≡ 355 (mod 859)

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