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

Euler's Totient Function Calculator

Computes Euler's totient φ(n), the count of integers from 1 to n that share no common factor with n. Essential for RSA encryption key generation and modular arithmetic problems.

Number (n)

List Coprime Numbers

Fill in the required fields to see your result.

Key differences

	Linear Diophantine Equation Solver	Euler's Totient Function Calculator
Category	Number Theory	Number Theory
Inputs required	4	2
Result	Solution Code	Totient φ(n)
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.	Computes Euler's totient φ(n), the count of integers from 1 to n that share no common factor with n. Essential for RSA encryption key generation and modular arithmetic problems.