Combinations in Real-World Problems
You'll learn how to apply the combination formula to solve practical problems involving committees, card games, and team selection where order doesn't matter.
The Core Idea
Now that you know the combination formula C(n,r) = n!/(r!(n-r)!), it's time to use it in realistic scenarios. The key insight is recognizing when a problem is asking "in how many ways can we select r items from n items" without caring about the order of selection. These situations appear everywhere: forming committees, dealing card hands, picking lottery numbers, or assembling sports teams.
Committee Selection
Problem: How many ways can a school select a 3-person committee from 10 volunteers?
Since the roles aren't distinguished (no "president" vs "secretary"), order doesn't matter. This is simply C(10,3) = 10!/(3!·7!) = 120 ways.
Card Hands
Problem: How many different 5-card poker hands exist in a standard 52-card deck?
You're choosing 5 cards from 52, and the order you receive them doesn't change the hand. Answer: C(52,5) = 2,598,960 hands.
Team Selection with Constraints
Problem: A coach must pick 4 starters from 6 guards and 5 forwards, selecting exactly 2 from each position. How many lineups are possible?
Break it down: Choose 2 guards from 6, and choose 2 forwards from 5. Multiply the independent choices: C(6,2) × C(5,2) = 15 × 10 = 150 lineups.
When to Use Combinations
Ask yourself: "Does rearranging my selection create a different outcome?" If no, use combinations. If yes (like assigning specific roles), you need permutations or a different approach.
Key Takeaway: Combinations solve real-world selection problems where order is irrelevant—identify the total items (n), the number to choose (r), and apply C(n,r), breaking complex problems into independent combination products when multiple selections occur.