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
74972102901-10
72292141-1021
291421-1021-52
14114021-52749
So our multiplicative inverse is -52 mod 749 ≡ 697
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
5455860545010
586545141101
54541131201-13
4112351-1340
12522-1340-93
522140-93226
2120-93226-545
So our multiplicative inverse is 226 mod 545 ≡ 226
Source: ExtendedEuclideanAlgorithm.com

nbqr t1t2t3
3193110901-10
319341-1031
9421-1031-72
414031-72319
So our multiplicative inverse is -72 mod 319 ≡ 247
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 ≡ 636 × 72-1 (mod 749) ≡ 636 × 697 (mod 749) ≡ 633 (mod 749)
x ≡ 920 × 586-1 (mod 545) ≡ 920 × 226 (mod 545) ≡ 275 (mod 545)
x ≡ 508 × 31-1 (mod 319) ≡ 508 × 247 (mod 319) ≡ 109 (mod 319)


Now the actual calculation

  1. Find the common modulus M
    M = m1 × m2 × ... × mk = 749 × 545 × 319 = 130217395
  2. We calculate the numbers M1 to M3
    M1=M/m1=130217395/749=173855,   M2=M/m2=130217395/545=238931,   M3=M/m3=130217395/319=408205
  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
    7491738550749010
    17385574923287101
    7498785301-8
    87531341-89
    5334119-89-17
    34191159-1726
    191514-1726-43
    1543326-43155
    4311-43155-198
    3130155-198749
    So our multiplicative inverse is -198 mod 749 ≡ 551
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    5452389310545010
    238931545438221101
    545221210301-2
    2211032151-25
    10315613-25-32
    1513125-3237
    13261-3237-254
    212037-254545
    So our multiplicative inverse is -254 mod 545 ≡ 291
    Source: ExtendedEuclideanAlgorithm.com

    nbqr t1t2t3
    3194082050319010
    4082053191279204101
    319204111501-1
    2041151891-12
    11589126-12-3
    89263112-311
    261124-311-25
    1142311-2561
    4311-2561-86
    313061-86319
    So our multiplicative inverse is -86 mod 319 ≡ 233
    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
    =  (633 × 173855 × 551 +
       275 × 238931 × 291 +
       109 × 408205 × 233)   mod 130217395
    = 14866785 (mod 130217395)


    So our answer is 14866785 (mod 130217395).


Verification

So we found that x ≡ 14866785
If this is correct, then the following statements (i.e. the original equations) are true:
72x (mod 749) ≡ 636 (mod 749)
586x (mod 545) ≡ 920 (mod 545)
31x (mod 319) ≡ 508 (mod 319)

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