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

Relations and Counting

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

Zachary Abel continues MIT's 6.1200J Mathematics for Computer Science with a lecture on relations and the start of counting. He defines a relation as a domain, a codomain, and a subset of ordered pairs, then narrows to relations on a single set, working through equivalence relations and partial orders with the properties that define them, such as reflexivity, symmetry, and transitivity. The second half of the lecture shifts into counting, laying groundwork for combinatorics used throughout computer science. The session is part of MIT OpenCourseWare's Spring 2024 offering of the course, delivered in the standard lecture hall format with board work and worked examples. It assumes familiarity with earlier material in the sequence on logic and proof technique, and it sets up the counting methods that later lectures build on.

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 13 of 2216 h 4 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
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