Euclidean Algorithm. For the basics and the table notation. Extended Euclidean Algorithm. Unless you only want to use this calculator for the basic Euclidean Algorithm. Multiplicative inverse. in case you are interested in calculating the multiplicative inverse of a number modulo n. using the Extended Euclidean Algorithm.

Calculator. For the Euclidean Algorithm, Extended Euclidean Algorithm and multiplicative inverse. Before you use this calculator. If you're used to a different notation, the output of the calculator might confuse you at first. Even though this is basically the same as the notation you expect. If that happens, don't panic.

Extended Euclidean algorithm calculator. Given two integers a and b, the extended Euclidean algorithm computes integers x and y such that a x + b y = g c d ( a, b). The algorithm computes a sequence of integers r 1 > r 2 > … > r m such that g c d ( a, b) divides r i for all i = 1, …, m using the classic 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 site already has The greatest common divisor of two integers, which uses the Euclidean algorithm. As it turns out (for me), there exists an Extended Euclidean algorithm.

Euclids Algorithm and Euclids Extended Algorithm Calculator: Euclids Algorithm and Euclids Extended Algorithm Video