Computing Basic Combinations
You'll learn: How to calculate the number of ways to choose r objects from n distinct objects using the combination formula.
The Core Idea
Now that you know the combination formula C(n,r) = n! / (r!(n-r)!), it's time to practice computing actual values. The key is working systematically: calculate the factorials in the numerator and denominator, then simplify before multiplying large numbers whenever possible.
Step-by-Step Calculation Process
Let's compute C(7,3) — the number of ways to choose 3 items from 7:
- Write the formula: C(7,3) = 7! / (3!(7-3)!) = 7! / (3! × 4!)
- Expand factorials strategically: Instead of computing full factorials, cancel common terms:
- 7! = 7 × 6 × 5 × 4!
- So: C(7,3) = (7 × 6 × 5 × 4!) / (3! × 4!)
- Cancel the 4!: C(7,3) = (7 × 6 × 5) / 3!
- Compute denominator: 3! = 6
- Final calculation: (7 × 6 × 5) / 6 = 210 / 6 = 35
Simplification Tips
- Always cancel the larger factorial in the denominator with part of n!
- Simplify fractions before multiplying when possible
- For C(n,0) or C(n,n), remember these equal 1 (choosing nothing or everything)
- Note that C(n,r) = C(n, n-r), so calculate whichever is easier (e.g., C(10,8) = C(10,2))
Practice Example
C(6,2) = 6! / (2! × 4!) = (6 × 5 × 4!) / (2 × 1 × 4!) = (6 × 5) / 2 = 30 / 2 = 15
Key Takeaway: When computing combinations, expand only enough factorials to cancel common terms, then simplify before multiplying to keep numbers manageable.