Compare calculators

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

Linear Diophantine Equation Solver

Finds all integer solutions to a linear Diophantine equation of the form ax + by = c. Use it when you need exact integer answers in problems involving divisibility, coin combinations, or scheduling.

Coefficient a

Coefficient b

Constant c

Solution Type

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

	Linear Diophantine Equation Solver	Chinese Remainder Theorem Solver
Category	Number Theory	Number Theory
Inputs required	4	6
Result	Solution Code	Solution (x)
What it does	Finds all integer solutions to a linear Diophantine equation of the form ax + by = c. Use it when you need exact integer answers in problems involving divisibility, coin combinations, or scheduling.	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.