Lecture 10: Modular Arithmetic

MIT 18.200 Principles of Discrete Applied Mathematics, Spring 2024 Instructor: Ankur Moitra View the complete course: https://ocw.mit.edu/courses/18-200-principles-of-discrete-applied-mathematics-spring-2024 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61p2fXeXjNCrfNHFwyW-bl0 Uploaded 17-12-25 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. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu Support OCW at http://ow.ly/a1If50zVRlQ We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments. Learn more about your ad choices. Visit megaphone.fm/adchoices Learn more about your ad choices. Visit megaphone.fm/adchoices