Chinese Remainder Theorem Calculator

x ≡ aᵢ (mod nᵢ)

All Tools

Loading tool...

About Chinese Remainder Theorem Calculator

A Chinese Remainder Theorem calculator solving systems of simultaneous congruences. Enter multiple x ≡ a (mod n) equations, verifies pairwise coprimality, and finds the unique solution modulo N = n₁·n₂·...·nₖ. Shows step-by-step computation. Client-side.

Chinese Remainder Theorem Calculator Features

  • System solver
  • Step-by-step
  • Coprimality check
  • Verification
  • Multiple equations
Advertisement
Advertisement