|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|
This calculator solves linear diophantine equations.
|Modular Multiplicative Inverse Calculator|
This inverse modulo calculator calculates the modular multiplicative inverse of a given integer a modulo m.
|Polynomial Greatest Common Divisor|
The calculator gives the greatest common divisor (GCD) of two input polynomials.
|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).
|Extended polynomial Greatest Common Divisor in finite field|
The calculator computes extended greatest common divisor of two polynomials in finite field
This online calculator computes Bézout's coefficients for two given integers, and represents them in the general form