(Abstract Algebra 1) Greatest Common Divisor

The greatest common divisor is defined and the Euclidean Algorithm is used to calculate the gcd.

[raymondchan]

You should also teach how to use Euclidean Algorithm to find the GCD of two polynomials since that's what I have seen people mostly use it for

[ashishKjr]

In 6:53, I believe b>=1 instead of b<=1.

[ashishKjr]

In 6:22, shouldn't all the 0 ≤ r_(i+1) ≤ r_i be 0 ≤ r_(i+1) < r_i by the division algorithm?
I think only the 0 ≤ r_(k+2) < r_(k+1) is fine.

[cepson]

Wouldn't any integer also be a divisor of itself? E.g., 192 = 1*192 + 0. So at 1:15, the list of divisors of 192 would include 192 itself?

[vikramtete]

6:33 there is an error...I think it must be b>=1

[adolfocarrillo]

Too complicated explanation for a simple concept, there's my dislike.