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
39717624501-2
176453411-27
454114-27-9
4141017-997
4140-997-397
So our multiplicative inverse is 97 mod 397 ≡ 97
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
2544470254010
4472541193101
25419316101-1
193613101-14
611061-14-25
1011004-25254
So our multiplicative inverse is -25 mod 254 ≡ 229
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
4157620415010
7624151347101
41534716801-1
34768571-16
68795-16-55
75126-5561
5221-5561-177
212061-177415
So our multiplicative inverse is -177 mod 415 ≡ 238
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 ≡ 96 × 176-1 (mod 397) ≡ 96 × 97 (mod 397) ≡ 181 (mod 397)
x ≡ 768 × 447-1 (mod 254) ≡ 768 × 229 (mod 254) ≡ 104 (mod 254)
x ≡ 266 × 762-1 (mod 415) ≡ 266 × 238 (mod 415) ≡ 228 (mod 415)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 397 × 254 × 415 = 41847770
  2. We calculate the numbers M1 to M3
    M1=M/m1=41847770/397=105410,   M2=M/m2=41847770/254=164755,   M3=M/m3=41847770/415=100838
  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
    3971054100397010
    105410397265205101
    397205119201-1
    2051921131-12
    192131410-12-29
    1310132-2931
    10331-2931-122
    313031-122397
    So our multiplicative inverse is -122 mod 397 ≡ 275
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    2541647550254010
    164755254648163101
    25416319101-1
    163911721-12
    9172119-12-3
    72193152-311
    191514-311-14
    1543311-1453
    4311-1453-67
    313053-67254
    So our multiplicative inverse is -67 mod 254 ≡ 187
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    4151008380415010
    100838415242408101
    4154081701-1
    40875821-159
    7231-159-178
    212059-178415
    So our multiplicative inverse is -178 mod 415 ≡ 237
    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
    =  (181 × 105410 × 275 +
       104 × 164755 × 187 +
       228 × 100838 × 237)   mod 41847770
    = 6360518 (mod 41847770)


    So our answer is 6360518 (mod 41847770).


Verification

So we found that x ≡ 6360518
If this is correct, then the following statements (i.e. the original equations) are true:
176x (mod 397) ≡ 96 (mod 397)
447x (mod 254) ≡ 768 (mod 254)
762x (mod 415) ≡ 266 (mod 415)

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