Modular Arithmetic and the Extended Euclidean Algorithm- Discrete Math Structures Lesson 7

In this video, I discuss modular arithmetic, equivalence classes, integers modulo n, the Euclidean Algorithm to find the greatest common divisor of two numbers, and the Extended Euclidean Algorithm to find the modular inverse of a number.