GCD and Bezout Theorem

GCD of two numbers a and b is their greatest common divisor. For example for 10 and 15, GCD is 5.

Bezout Theorem, in essence, describes the equation 10x + 15y = 5. It ensures that there are integer solutions to this equation. In fact for any two integers a and b, if GCD(a, b) = d, Bezout Theorem says that there are integer solutions to the equation: ax + by = d

I.S.I. C.M.I. Entrance Solutions and Mock Tests Center

Try

Subscribe to Cheenta at Youtube

---