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

Counting Techniques

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

MIT lecturer Zachary Abel continues the counting unit of 6.1200J Mathematics for Computer Science, teaching how product rules combine to count structured sets. The session works through card-based examples, using poker hands and similar combinatorial setups to show how to break a counting problem into sequential choices and multiply the possibilities at each step. Abel builds up from simple product rule applications to more layered scenarios where multiple counting principles must be applied in sequence, emphasizing the reasoning process for recognizing which technique fits which structure. Delivered as a standard MIT OpenCourseWare recorded lecture with blackboard work and worked problems, the class fits into the broader discrete mathematics and combinatorics sequence central to computer science foundations.

At a glance

Lecture facts

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

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 14 of 2217 h 23 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