Compare calculators

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

Chinese Remainder Theorem Calculator

Finds the smallest non-negative integer x satisfying a system of two or three simultaneous modular congruences. Used in cryptography, scheduling problems, and number theory proofs.

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.

Number Theory

Quadratic Residue Calculator

Determines whether an integer a is a quadratic residue or non-residue modulo a prime p using Euler's criterion. Useful in number theory, cryptography, and primality testing.

Number (a)

Prime Modulus (p)

Fill in the required fields to see your result.

Key differences

	Chinese Remainder Theorem Calculator	Quadratic Residue Calculator
Category	Number Theory	Number Theory
Inputs required	6	2
Result	Solution (x)	Quadratic Residue Result
What it does	Finds the smallest non-negative integer x satisfying a system of two or three simultaneous modular congruences. Used in cryptography, scheduling problems, and number theory proofs.	Determines whether an integer a is a quadratic residue or non-residue modulo a prime p using Euler's criterion. Useful in number theory, cryptography, and primality testing.