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:

[st]

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

[jaideepshekhar]

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!

[idanch]

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

[RAPEVERMRC]

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

[ej]

At 4:53 you write: 180=11*16+4 but correct would be +20 instead of +4 and then you get 20=16+4 followed by 16=4*4+0 and gcd=4

[snookandrew]

7:14 I said "Ohhhh" out loud as now I think I get it.Thank you

[egoxagony]

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

[gavintillman]

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

[pedrorivera]

lol I also forgot my PIN during the pandemic

[coryanders]

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

[pedrorivera]

lol I also forgot my PIN during the pandemic