The Euclidean Algorithm for the Integers 
The Euclidean Algorithm for the Integers
by Robert Donley
Video Lecture 17 of 17
Not yet rated
Views: 762
Date Added: March 9, 2015

Lecture Description

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.

Course Index

Course Description

Math Doctor Bob provides a brief course on logic, proofs, sets, and the integers. Intended as a prerequisite playlist for Abstract Algebra and Real Analysis courses.


There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)