Abstract Algebra | 3. The Euclidean Algorithm

preview_player
Показать описание
In this video, we give an algorithm to compute greatest common divisors called the Euclidean Algorithm. We prove why the algorithm works and then use it in some examples. We also use the steps in the Euclidean Algorithm to express the gcd of two integers a and b as an integer linear combination of a and b.
Рекомендации по теме
Комментарии
Автор

Loving this course so far! Only a few episodes in so far, but I enjoy how you take a proof-centric view of the subject. I've always enjoyed my math classes that take the time to rigorously justify all of the claims used, building up the base of knowledge for the student, rather than skipping over it as "trivial" or as "exercises for the viewer/reader".

jackmccarthy