|The greatest common divisor of two integers|
This calculator determines the greatest common divisor of two integers using Euclidean algorithm
|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
|Modular Multiplicative Inverse|
This calculator calculates the modular multiplicative inverse of a given integer a modulo m. The theory is below the calculator.
|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 computes Bézout's coefficients for two given integers, and represents them in the general form