Welcome to ChineseRemainderTheorem.com!
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?- Read about how to execute the Chinese Remainder Theorem
- Discover different ways to calculate multiplicative inverses
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:
| n | b | q | r | t1 | t2 | t3 |
|---|---|---|---|---|---|---|
| 29 | 286 | 0 | 29 | 0 | 1 | 0 |
| 286 | 29 | 9 | 25 | 1 | 0 | 1 |
| 29 | 25 | 1 | 4 | 0 | 1 | -1 |
| 25 | 4 | 6 | 1 | 1 | -1 | 7 |
| 4 | 1 | 4 | 0 | -1 | 7 | -29 |
Source: ExtendedEuclideanAlgorithm.com
| n | b | q | r | t1 | t2 | t3 |
|---|---|---|---|---|---|---|
| 269 | 168 | 1 | 101 | 0 | 1 | -1 |
| 168 | 101 | 1 | 67 | 1 | -1 | 2 |
| 101 | 67 | 1 | 34 | -1 | 2 | -3 |
| 67 | 34 | 1 | 33 | 2 | -3 | 5 |
| 34 | 33 | 1 | 1 | -3 | 5 | -8 |
| 33 | 1 | 33 | 0 | 5 | -8 | 269 |
Source: ExtendedEuclideanAlgorithm.com
| n | b | q | r | t1 | t2 | t3 |
|---|---|---|---|---|---|---|
| 893 | 9 | 99 | 2 | 0 | 1 | -99 |
| 9 | 2 | 4 | 1 | 1 | -99 | 397 |
| 2 | 1 | 2 | 0 | -99 | 397 | -893 |
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 ≡ 369 × 286-1 (mod 29) ≡ 369 × 7 (mod 29) ≡ 2 (mod 29)x ≡ 901 × 168-1 (mod 269) ≡ 901 × 261 (mod 269) ≡ 55 (mod 269)x ≡ 689 × 9-1 (mod 893) ≡ 689 × 397 (mod 893) ≡ 275 (mod 893)
So now we have the following equations of the form x ≡ a (mod m):
x ≡ 2 (mod 29)
x ≡ 55 (mod 269)
x ≡ 275 (mod 893)
Now the actual calculation
- Find the common modulus M
M = m1 × m2 × ... × mk = 29 × 269 × 893 = 6966293 - We calculate the numbers M1 to M3
M1=M/m1=6966293/29=240217,M2=M/m2=6966293/269=25897,M3=M/m3=6966293/893=7801 - 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:
So our multiplicative inverse is 3 mod 29 ≡ 3n b q r t1 t2 t3 29 240217 0 29 0 1 0 240217 29 8283 10 1 0 1 29 10 2 9 0 1 -2 10 9 1 1 1 -2 3 9 1 9 0 -2 3 -29
Source: ExtendedEuclideanAlgorithm.com
So our multiplicative inverse is -70 mod 269 ≡ 199n b q r t1 t2 t3 269 25897 0 269 0 1 0 25897 269 96 73 1 0 1 269 73 3 50 0 1 -3 73 50 1 23 1 -3 4 50 23 2 4 -3 4 -11 23 4 5 3 4 -11 59 4 3 1 1 -11 59 -70 3 1 3 0 59 -70 269
Source: ExtendedEuclideanAlgorithm.com
So our multiplicative inverse is 140 mod 893 ≡ 140n b q r t1 t2 t3 893 7801 0 893 0 1 0 7801 893 8 657 1 0 1 893 657 1 236 0 1 -1 657 236 2 185 1 -1 3 236 185 1 51 -1 3 -4 185 51 3 32 3 -4 15 51 32 1 19 -4 15 -19 32 19 1 13 15 -19 34 19 13 1 6 -19 34 -53 13 6 2 1 34 -53 140 6 1 6 0 -53 140 -893
Source: ExtendedEuclideanAlgorithm.com
- 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
= (2 × 240217 × 3 +
55 × 25897 × 199 +
275 × 7801 × 140) mod 6966293
= 53855 (mod 6966293)
So our answer is 53855 (mod 6966293).
Verification
So we found that x ≡ 53855
If this is correct, then the following statements (i.e. the original equations) are true:
286x (mod 29) ≡ 369 (mod 29)
168x (mod 269) ≡ 901 (mod 269)
9x (mod 893) ≡ 689 (mod 893)
Let's see whether that's indeed the case if we use x ≡ 53855.