Lecture 10: Modular Arithmetic
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.
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
edit_note
Editable Files
notes
Lecture Notes
theaters
Lecture Videos
assignment
Problem Sets
