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

Divisibility

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

MIT's 6.1200J Mathematics for Computer Science, taught by Erik Demaine, covers number theory applied to computing. This lecture works through divisibility, the greatest common divisor, and the Extended Euclidean Algorithm, building the tools needed for later cryptography topics in the course. Demaine develops the proofs on the board step by step, showing how GCD computations connect to solving linear Diophantine equations and to finding modular inverses. The session is part of the Spring 2024 offering of MIT's discrete mathematics course for computer science students, which also covers graph theory, counting, and probability elsewhere in the syllabus. Runtime is about 79 minutes, recorded in a standard MIT OpenCourseWare lecture hall format with clear audio and legible board work throughout.

At a glance

Lecture facts

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

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 6 of 226 h 40 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
Modular Arithmetic

Modular Arithmetic

MIT · 80 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