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

Lecture 17: More Counting Techniques

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

MIT's 6.1200J Mathematics for Computer Science continues its unit on combinatorics with instructor Brynmor Chapman working through the pigeonhole principle. The lecture builds on prior counting techniques, showing how pigeonhole arguments let you prove that certain outcomes must occur once a set exceeds a given size, and applies the principle to a series of worked counting problems. Running 81 minutes, the session keeps to MIT's standard lecture format: a chalkboard or whiteboard presentation with step by step derivations and example problems meant to be followed alongside problem sets. It is part of the Spring 2024 offering of 6.1200J, a core discrete mathematics course for computer science students, and assumes familiarity with earlier counting methods covered in the course. The focus stays squarely on technique and proof strategy rather than application outside mathematics.

At a glance

Lecture facts

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

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 15 of 2218 h 38 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