LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Modular Arithmetic
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Modular Arithmetic

80 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 9

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.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 20 m
Compared with MathematicsLonger than 76%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 7 of 227 h 59 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN