Introduction
Selection-with-conditions problems ask you to choose items subject to limits like “at least one”, “at most two”, “exactly three”, or mixed constraints. These problems are common in exams because they test both combination ideas and case-wise counting.
This pattern is important because breaking the condition into clear cases (or using complementary counting) makes otherwise tricky selection problems straightforward.
Pattern: Selection with Conditions (At least / At most)
Pattern
Key idea: Translate the verbal condition into cases (exact counts) or use complement (Total - forbidden). Use combinations for unordered selections and add counts across valid cases.
Typical approaches:
- Direct case-splitting: Sum combinations for each allowed value, e.g. “at most 2” → compute for 0 + 1 + 2.
- Complementary counting: Compute total combinations and subtract disallowed cases, useful for “at least one”.
- Mixed constraints: Use nested choices (choose required items first, then pick remaining from allowed pool).
- Ordering not important: Use nCr for selections; if order matters use nPr.
Step-by-Step Example
Question
From 8 distinct books, in how many ways can you choose a selection of at most 2 books?
Solution
-
Step 1: Translate the condition to cases.
“At most 2” means choose 0 books, or 1 book, or 2 books. We'll compute each case and add. -
Step 2: Use combination formula for each case.
- Choose 0:
8C0 = 1. - Choose 1:
8C1 = 8. - Choose 2:
8C2 = 8×7 / 2 = 28.
- Choose 0:
-
Step 3: Add the cases.
Total = 1 + 8 + 28 = 37. -
Final Answer:
There are 37 possible selections. -
Quick Check:
Total subsets of 8 items = 28 = 256; subsets of size > 2 = (256 - 37) = 219 → plausible that at most-2 count is small ✅
Quick Variations
1. At least one: Use complement → Total - none. Example: from n items, at least one = 2n - 1.
2. At most k: Sum nC0 + nC1 + ... + nCk.
3. Exactly r with restrictions: If some items must or must not be included, fix those first then use combinations on the rest.
4. At least r: Sum from r up to n, or use Total - (sum 0 to r-1).
Trick to Always Use
- Step 1 → Read the condition and decide whether complement (Total - forbidden) or direct cases is simpler.
- Step 2 → When summing cases, compute combinations for each r using
nCr = n! / (r! (n - r)!)and add results. - Step 3 → For mixed constraints (e.g., “at least 1 from group A”), pick required items first (use combinations), then choose remaining from the rest.
- Step 4 → Quick sanity check: result ≤ total possible selections (2n for subsets) or ≤ nCr for fixed-size problems.
Summary
Summary
Key takeaways for selection problems with conditions:
- “At most k” → sum
nC0 + nC1 + ... + nCk. - “At least k” → sum
nCk + nC(k+1) + ... + nCnor use complement:2^n - (nC0 + ... + nC(k-1)). - “Exactly r with requirements” → choose required items first, then choose remaining using combinations.
- Always perform a quick check against totals (2n for subsets, nCr for fixed-size) to catch arithmetic slips.
Hint: At least one = 2^n - 1.
Common Mistakes: Including the 'none' case when the question asks for at least one.