
Lecture 17: More Counting Techniques
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.