Introduction to Combinatorics and Counting Principles - From Basic Problems to Sieve Theorem
Wrath of Math via YouTube
MIT Sloan: Lead AI Adoption Across Your Organization — Not Just Pilot It
Get 20% off all career paths from fullstack to AI
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 combinatorics concepts in this 25-minute mathematics video that introduces basic counting problems through clear explanations and practical examples. Master the fundamental principle of enumeration, discover clever counting techniques, and learn the sieve theorem (inclusion/exclusion principle) for determining the number of elements in set unions. Progress through engaging segments covering initial counting challenges, block coloring applications, and a detailed three-part breakdown of the sieve theorem, culminating in a comprehensive formula derivation that solidifies understanding of these essential mathematical concepts.
Syllabus
Intro
Our First Counting Problem
Fundamental Principle of Enumeration
Coloring Blocks
Sieve Theorem Part 1
Sieve Theorem Part 2
Sieve Theorem Part 3
The Formula
Conclusion
Taught by
Wrath of Math