
Counting Techniques
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.