The GCD and Linear Diophantine Equations (Part 2)
Continuation of Part 1. We discover a tight link between the gcd of a and b, on the one hand, and the set of linear combinations of a and b on the other. That gives us a powerful statement about when we can solve a linear Diophantine equation, and a method for finding a solution using the Euclidean Algorithm.
Watch video The GCD and Linear Diophantine Equations (Part 2) online without registration, duration hours minute second in high quality. This video was added by user David Metzler 16 October 2016, don't forget to share it with your friends and acquaintances, it has been viewed on our site 303 once and liked it 5 people.