Compare calculators

Both calculators run independently — change the inputs on either side to compare results.

Chinese Remainder Theorem Solver

Find the unique integer that satisfies multiple simultaneous modular congruences. Use this when solving scheduling puzzles, cryptographic problems, or any system where a number must leave specific remainders under different divisors.

First Remainder (r₁)

First Modulus (m₁)

Second Remainder (r₂)

Second Modulus (m₂)

Third Remainder (r₃) - Optional

Third Modulus (m₃) - Optional

Fill in the required fields to see your result.

Number Theory

Chinese Remainder Theorem Solver

Solve systems of simultaneous modular congruences using the Chinese Remainder Theorem (CRT). Essential for cryptography, competitive programming, and advanced number-theory coursework.

First Remainder (a₁)

First Modulus (m₁)

Second Remainder (a₂)

Second Modulus (m₂)

Third Remainder (a₃, Optional)

Third Modulus (m₃, Optional)

Fill in the required fields to see your result.

Key differences

	Chinese Remainder Theorem Solver	Chinese Remainder Theorem Solver
Category	Number Theory	Number Theory
Inputs required	6	6
Result	Solution (x)	Solution (x)
What it does	Find the unique integer that satisfies multiple simultaneous modular congruences. Use this when solving scheduling puzzles, cryptographic problems, or any system where a number must leave specific remainders under different divisors.	Solve systems of simultaneous modular congruences using the Chinese Remainder Theorem (CRT). Essential for cryptography, competitive programming, and advanced number-theory coursework.