Lecture 10: Modular Arithmetic

Name: Lecture 10: Modular Arithmetic
Uploaded: 2025-12-17T16:28:00Z
Duration: 1 h 18 min 50 s
Description: We introduce modular arithmetic. We then discuss inverses mod m. We give the Euclidean algorithm for finding the GCD (greatest common divisor) and use the extended Euclidean algorithm to find inverses. Finally, we cover the Chinese remainder theorem.

1:18:50

We introduce modular arithmetic. We then discuss inverses mod m. We give the Euclidean algorithm for finding the GCD (greatest common divisor) and use the extended Euclidean algorithm to find inverses. Finally, we cover the Chinese remainder theorem.