This calculator determines the greatest common divisor of two integers using 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

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

The calculator gives the greatest common divisor (GCD) of two input polynomials.

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