Counting - Binomial Coefficients, Bijections, and Catalan Numbers - Lecture 4
MIT OpenCourseWare via YouTube
Learn Generative AI, Prompt Engineering, and LLMs for Free
Learn Backend Development Part-Time, Online
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore fundamental counting techniques in discrete mathematics through this 78-minute lecture from MIT's Principles of Discrete Applied Mathematics course. Learn about binomial coefficients and bijections while mastering the powerful technique of counting objects in multiple ways to establish mathematical relationships. Discover how Catalan numbers emerge as a unifying concept that counts seemingly different combinatorial structures including Dyck paths, plane trees, and binary trees, demonstrating the elegant connections between various mathematical objects through bijective proofs.
Syllabus
Lecture 4: Counting
Taught by
MIT OpenCourseWare