Extended Euclidean Algorithm Example

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.

[craigtyle]

Super clear - the point about treating the underlined numbers as variables was key.

[grog]

Thank you, finally a video that shows every step and explains it without assuming you basically already know how to do it! Nothing I've read or seen until now talked about treating them like variables, which helped me tremendously.

[hhlbrxc]

Dude taught in 15 minutes what my boolean algebra teacher couldn't in a week.

[elChico-TV]

Best and simplest explanation on Youtube . Thanks

[cent]

This guy is the best explanator of such a complicated thing. Everything in simple words and step by step. THANKS

[Schindleria]

Nice explanation, the division into those different areas actually helps a lot. Is not the first time I'm learning it and I'm definetively keeping that structure

[jnellyproductions]

6 years later and you just helped me understand the extended part of euclidean algorithm after watching probably close to 20 other videos. Thank you!

[bakangsbakho]

Euclid and Bezout were on drugs that day

[just_bucket]

It's a shame we can't mark videos as the best solutions the same way we can do it on forums. This is definitely the best explanation on this topic.

[annorome]

Imagine a video, that is not intended to show, how to calculate the private exponent d in RSA with the extended euclidean algorithm, doing the best job of providing a step by step solution, with no holes or skips in it. Really good work! Your video is better than any RSA private exponent calculation video for understanding how the retreive d.

[chrisanders]

what a legend, this thaught me better than my prof at uni in discrete math lecture

[mikenjuki]

I couldn't understand this in class but I understood it in 15 min. Thanks!

[michellemason]

Showing the underlining of the numbers really was the missing link for my brain to understand this! Thank you!

[wrxth]

the greatest video of all time. watched 10 different videos on the same topic but they all have 1 thing in common, they dont tell you the real deal, they just assume you already know that 1 thing so they quickly brush it off. The whole underline as a variable thing is a game changer and what made me understand. Thank you.

[stevewest]

This is the best video I've seen on the extended Euclidean. The pointer at 9:50- to treat the number as if they were variables- is a critical step for people learning this for the first time. A lot of other videos speed through this critical step.

[kevinramdass]

Treating the underlined numbers as variables was a game changer...Thank you so much @John Bowers

[hagenfarrell]

My professor was speed running this algorithm in class, we covered it in like 10 mins. Thank you for the thorough explanation!

[dugannash]

GREAT explanation. As others have noted, treating the numbers as variables is what ultimately unlocked this for me. It's so unlike anything I've done previously in my limited math experience, I could not tell what was happening until this video made it clear. Thanks a lot!

[valentinenyagah]

At first I did not understand what my lecturer taught me in class but now I am happy to say i'll ace that exam....T
hank you so much

[crti_sl]

It was very easy to follow along with your explanation, and the way you formatted it makes it easier to remember the process. Thank you.