Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Introduction to Combinatorics and Counting Principles - From Basic Problems to Sieve Theorem

Wrath of Math via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Introduction to Combinatorics and Counting Principles - From Basic Problems to Sieve Theorem

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.