Chinese Remainder Theorem Calculator
Solve compatible residue and modulus pairs, including noncoprime moduli.
Loading tool…
How to use Chinese Remainder Theorem Calculator
Merge congruences using extended gcd, checking compatibility before normalizing the solution modulo the combined least common multiple.
- Enter residue, modulus pairs (one row each).
- Check the model, units, and supported limits before calculating.
- Run the tool, inspect the result, then copy or download it.
Good to know
- 1–25 rows, each residue and positive modulus a whole number of magnitude at most 1e12. Moduli must be at least two. Exact BigInt output.
- Runs locally. Numeric inputs are bounded; floating-point output is approximate and rounded to 12 significant digits. Unsupported or non-finite calculations produce an error.
Common questions
How does Chinese Remainder Theorem Calculator calculate its result?
Merge congruences using extended gcd, checking compatibility before normalizing the solution modulo the combined least common multiple.
What assumptions and boundaries apply?
1–25 rows, each residue and positive modulus a whole number of magnitude at most 1e12. Moduli must be at least two. Exact BigInt output.
Keep going with related tools
All math →Modular Arithmetic Calculator
Calculate exact modular powers or inverses for bounded whole numbers.
MathInteger Factorization Calculator
Factor a bounded positive integer into exact prime powers and verify reconstruction.
MathPrime Number Checker
Determine primality for whole numbers up to 4,294,967,295 using bounded deterministic testing.
MathPrime-field Linear System Workbench
Solve a rectangular modular system and preserve inconsistent, unique and affine-family outcomes with exact solution witnesses.