
Modular Arithmetic
Brynmor Chapman teaches Lecture 9 of MIT's 6.1200J, Mathematics for Computer Science, covering modular arithmetic as a tool for computer science reasoning. The lecture builds from simple questions, such as what day of the week falls 100 days from now, to show how remainder operations formalize cyclical computation, working through examples like rem(100, 2) = 2 to get from Tuesday to Thursday. Chapman develops the rules governing addition, multiplication, and congruence under a modulus, connecting the abstract number theory to problems that show up directly in programming and cryptography. Delivered as a chalkboard-style university lecture running about eighty minutes, it is part of MIT OpenCourseWare's full release of the Spring 2024 course, suited to students who already have basic proof and logic background from earlier sessions.