...Bezout's identity step by step!? 1)For any two integers a and b, their greatest common divisor and their least common multiple satisfy the following identity: gcd(a,b) times lcm(a,b)= abosolute value of ab
2)if a and b are nonzero integers with greatest common divisor d, then there exist integers x and y (called Bézout numbers or Bézout coefficients) such that ax + by =d
2)if a and b are nonzero integers with greatest common divisor d, then there exist integers x and y (called Bézout numbers or Bézout coefficients) such that ax + by =d