Bézout's Identity

If a and b are integers not both equal to 0, then there exist integers u and v such that


where GCD(a,b) is the greatest common divisor of a and b.

See also

Bézout Numbers, Greatest Common Divisor

Explore with Wolfram|Alpha


Jones, G. A. and Jones, J. M. "Bezout's Identity." §1.2 in Elementary Number Theory. Berlin: Springer-Verlag, pp. 7-11, 1998.

Referenced on Wolfram|Alpha

Bézout's Identity

Cite this as:

Weisstein, Eric W. "Bézout's Identity." From MathWorld--A Wolfram Web Resource.

Subject classifications