You've learned permutations where order matters. But what if order doesn't matter? Choosing 3 students from 5 has fewer options than arranging them in order.
In this section, I'll show you combinations: counting selections where order is irrelevant. You'll learn the formula, understand why it works, and see how Pascal's Triangle connects everything.
By the end, you'll calculate C(n,k) instantly, recognize when order matters versus when it doesn't, and solve problems involving subsets and selections.