Compare calculators

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

GCD and LCM Calculator

Instantly compute the Greatest Common Divisor and Least Common Multiple of two integers. Ideal for simplifying fractions, scheduling repeating events, or solving ratio problems.

First Number

Second Number

Fill in the required fields to see your result.

Number Theory

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.

Key differences

	GCD and LCM Calculator	Chinese Remainder Theorem Solver
Category	Number Theory	Number Theory
Inputs required	2	6
Result	GCD and LCM	Solution (x)
What it does	Instantly compute the Greatest Common Divisor and Least Common Multiple of two integers. Ideal for simplifying fractions, scheduling repeating events, or solving ratio problems.	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.