Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Apr 17, 2012
Basic Methods: Revisiting the proof of Bezout's Identity, we give an algorithm for computing gcd(m, n) without factoring m and n. In turn, the Euclidean algorithm provides a method for finding the coefficients in Bezout's identity.