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...
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