Master the Extended Euclidean Algorithm with Example #1 ✨
Learn how to find the GCD of two numbers and express it as a linear combination using the extended Euclidean algorithm with this step-by-step example.
Michael Penn
31.8K views • Aug 24, 2019
About this video
We use the extended Euclidean algorithm to write the greatest common divisor of two natural numbers as a linear combination of them.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
31.8K
Likes
573
Duration
8:53
Published
Aug 24, 2019
User Reviews
4.7
(6)