This calculator determines the greatest common divisor of two integers using Euclidean algorithm

Calculate the greatest common divisor (GCD) and the least common multiple (LCM) of two integers.

This calculator implements Extended Euclidean algorithm, which computes, besides the greatest common divisor of integers a and b, the coefficients of Bézout's identity

This calculator solves linear diophantine equations (LDE). The LDE calculator is right below, and if you want to recall what linear diophantine equations are, you can find the theory after the calculator.

This inverse modulo calculator calculates the modular multiplicative inverse of a given integer a modulo m.

How to use big number input and PCR library.

The Fraction Simplifier Calculator employs the greatest common factor (GCF) to simplify any fraction you enter, reducing it to its simplest form.

The Greatest Common Factor (GCF) calculator is a powerful tool for finding the greatest common factor of two or more numbers.

This online calculator computes Bézout's coefficients for two given integers, and represents them in the general form

This calculator finds the Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of two or more integers by performing prime factorization

This calculator checks if the entered numbers are coprime and pairwise coprime