The Combination Formula: C(n,r) = n!/(r!(n-r)!)
What you'll learn: You'll discover how to derive and apply the formula that counts the number of ways to choose r items from n items when order doesn't matter.
Why We Need This Formula
In the previous lesson, you learned that combinations count selections where order doesn't matter. Now we need an efficient way to calculate them. The combination formula gives us exactly that.
Deriving the Formula
Let's think through this step by step:
Step 1: First, count as if order does matter. The number of ways to arrange r items chosen from n items is the permutation P(n,r) = n!/(n-r)!
Step 2: But wait—we've overcounted! Each unique combination of r items appears multiple times in our permutation count, once for each possible arrangement of those r items.
Step 3: How many times does each combination appear? Exactly r! times (the number of ways to arrange r items).
Step 4: To get the true count of combinations, divide out this overcounting:
C(n,r) = P(n,r) / r! = n! / (r!(n-r)!)
An Analogy
Imagine you're selecting 3 students from a class of 10 for a committee. Using permutations, you count {Alice, Bob, Carol} as different from {Bob, Alice, Carol}. But for a committee, these are the same group! The formula divides by 3! = 6 to collapse all 6 arrangements into one combination.
Example Calculation
C(5,2) = 5! / (2!(5-2)!) = 120 / (2·6) = 120/12 = 10
There are 10 ways to choose 2 items from 5.
Key Takeaway: The combination formula C(n,r) = n!/(r!(n-r)!) counts unordered selections by starting with permutations and dividing out the r! orderings of each group.