February 28, 2020

GCD and Bezout Theorem

Get motivated


Consider the equation 2019x + 2020y = 2018. Are there integers x and y that satisfy this equation?

Concepts in this lesson will help you to answer this question and more.

Concept - GCD, 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

Watch Part 1


Subscribe to Cheenta at Youtube


Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Cheenta. Passion for Mathematics

Advanced Mathematical Science. Taught by olympians, researchers and true masters of the subject.
JOIN TRIAL
support@cheenta.com
enter