Extended Greatest Common Divisor

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint GCD(m,n)=rm+sn for r and s given integers. It is used in solving linear Diophantine equations, and is implemented in the Wolfram Language as ExtendedGCD[m, n].

See also

Greatest Common Divisor

Related Wolfram sites

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Extended Greatest Common Divisor." From MathWorld--A Wolfram Web Resource.

Subject classifications