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

This lesson covers modular arithmetic, equivalence classes, integers modulo n, and the Euclidean Algorithm for finding the greatest common divisor of two numbers.