Bezout's identity is a theorem that states that for any two integers a, b, there exist integers x and y such that ax + by = gcd(a,b).
Bezout's identity is a theorem that states that for any two integers a, b, there exist integers x and y such that ax + by = gcd(a,b).