The extended Euclidean algorithm in one simple idea

An intuitive explanation of the extended Euclidean algorithm as a simple modification of the Euclidean algorithm.
This video is part of playlist on GCDs and the Euclidean algorithm:
• GCDs and Euclidean alg...

[@st8113]

Wow! I spent days going through obtuse academic videos looking for an explanation this intuitive and this easily applicable. Thanks a lot.

[@jaideepshekhar4621]

This is SUCH a great explanation! I showed it to my professor and made them promise to teach my juniors like this. Peace, love and fun maths!

[@idanch4]

was watching this before I understood multiplicative inverses well and the last bit blew my mind. great videos!

[@Amaranta1729]

Wow that's SO CLEAR!

[@myryinae9884]

Such a great video. Thank you

[@RAP4EVERMRC96]

Really good videos. Will recommend fellow students. This videos deserve way more views. I love the easy outcome to why the modulo inverse only exists for integers coprime to the modulo. I never understood that and just took it as taken

[@manaoharsam4211]

Very nice explanation.

[@gauravlagad1360]

This is really good!

[@tunvas]

you're a genius

[@kevinkasp]

Brilliant

[@gavintillman1884]

I wish KZbin had been around when I did my maths degree!

[@obinnaomego1971]

I am subscribing

[@egoxagony4623]

why doesnt this work for negative diophantine equations such as 7x -9y = 3. Or 10x -8y

[@pedrorivera4405]

lol I also forgot my PIN during the pandemic

[@coryanders6328]

This didn't do it for me. I feel as if my understanding has regressed after watching this😢

[@pedrorivera4405]

lol I also forgot my PIN during the pandemic