|The greatest common divisor of two integers|
This calculator determines the greatest common divisor of two integers using Euclidean algorithm
|Greatest Common Divisor and Least Common Multiple Calculator|
Calculate the greatest common divisor (GCD) and the least common multiple (LCM) of two integers.
|Extended Euclidean algorithm|
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
|Linear Diophantine Equations Solver|
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.
|Modular Multiplicative Inverse Calculator|
This inverse modulo calculator calculates the modular multiplicative inverse of a given integer a modulo m.
|Tips and tricks #9: Big numbers|
How to use big number input and PCR library.
|Fraction Simplifier Calculator: Simplify Fractions to Lowest Terms|
The Fraction Simplifier Calculator employs the greatest common factor (GCF) to simplify any fraction you enter, reducing it to its simplest form.
|Greatest Common Factor Calculator for Three or More Numbers|
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
|The Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of several numbers|
This calculator finds the Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of two or more integers by performing prime factorization
|Coprime integers and pairwise coprime integers|
This calculator checks if the entered numbers are coprime and pairwise coprime