In this video I show how to run the extended Euclidean algorithm to calculate a GCD and also find the integer values guaranteed to exist by Bezout's theorem.
On this page of the site you can watch the video online Extended Euclidean Algorithm Example with a duration of hours minute second in good quality, which was uploaded by the user John Bowers 14 September 2017, share the link with friends and acquaintances, this video has already been watched 357,189 times on youtube and it was liked by 6.2 thousand viewers. Enjoy your viewing!