|The greatest common divisor of two integers|
This calculator determines the greatest common divisor of two integers using Euclidean algorithm
|The greatest common divisor and the least common multiple of two integers|
This calculator finds 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.
This online calculator simplify the entered fraction using the greatest common factor (GCF)
|The Greatest Common Factor of several numbers|
This online calculator finds the greatest common factor of several numbers (two or more).
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
|Comprime integers and pairwise coprime integers|
This calculator checks if the entered numbers are coprime and pairwise coprime