# Bezout’s lemma (number theory)

Let $a,b$ be integers, not both zero. Then there exist two integers $x,y$ such that:

 $ax+by=\gcd(a,b).$

This does not only work on $\mathbb{Z}$ but on every integral domain where an Euclidean valuation has been defined.

Title Bezout’s lemma (number theory) BezoutsLemmanumberTheory 2013-03-22 12:40:40 2013-03-22 12:40:40 mathwizard (128) mathwizard (128) 10 mathwizard (128) Theorem msc 11A05 Bezout’s lemma Bezout’s theorem EuclidsAlgorithm EuclidsCoefficients GreatestCommonDivisorOfSeveralIntegers