18.200 Principles of Discrete Applied Mathematics
18.200 Principles of Discrete Applied Mathematics (Spring 2024, MIT OCW). Instructors: Prof. Ankur Moitra, Prof. Peter Shor, and Susan Ruff. This course will teach you illustrative topics in discrete applied mathematics, including counting, generating functions, probability, linear optimization, algebraic structures, basic number theory, information theory, and coding theory. It is a CI-M (Communication Intensive in the Major) course and thus includes a writing component. (from ocw.mit.edu)
| 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.
Go to the Course Home or watch other lectures: