Combinations with All or None: C(n,0) and C(n,n)
What you'll learn: You'll understand why choosing nothing from a set and choosing everything from a set both have exactly one way to occur.
The Core Idea
When working with combinations, two edge cases often puzzle students: what happens when you choose zero items, or when you choose all items?
C(n,0) – Choosing Nothing:
There is exactly one way to choose nothing from a set of n items. Think about it: when you decide to select zero objects, you don't make any choices at all. There's no variation in "doing nothing"—you simply don't pick anything. This gives us C(n,0) = 1.
C(n,n) – Choosing Everything:
Similarly, there is exactly one way to choose all n items from a set of n items. You grab everything available—there's no room for variation or alternative selections. This gives us C(n,n) = 1.
Why This Makes Sense
Using the combination formula C(n,r) = n!/(r!(n-r)!):
- C(n,0) = n!/(0!(n-0)!) = n!/(1·n!) = 1
- C(n,n) = n!/(n!(n-n)!) = n!/(n!·0!) = n!/(n!·1) = 1
Notice that 0! = 1 by convention, which makes these formulas work beautifully.
An Analogy
Imagine a buffet with n dishes. If you take a "none" portion, there's only one outcome: an empty plate. If you take "everything," there's only one outcome: your plate has all n dishes. No other arrangements exist in either case.
Key Takeaway: There is exactly one way to select nothing from any set (C(n,0) = 1) and exactly one way to select everything (C(n,n) = 1), reflecting that these extreme cases have no room for variation.