Selections
A selection counts groups, not orders — picking {A, B, C} is the same outcome as {C, B, A}. The count is nCr = n!/(r!(n−r)!), the number of ways to choose r of n. Two facts save time in CAT. First, nCr = nC(n−r): choosing 8 of 10 to keep is the same as choosing 2 to leave out, so compute the easier side. Second, the sum nC0 + nC1 + … + nCn = 2ⁿ counts every possible subset, which gives "at least one" as 2ⁿ − 1 instantly. Selection problems often split into cases joined by "and" (multiply) and "or" (add): a committee of 2 men and 3 women from 5 men, 6 women is 5C2 × 6C3. When a problem says "at least", it is usually faster to count the complement and subtract from the total.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Core counting
| Permutations (order matters) | nPr = n! / (n − r)! |
|---|---|
| Combinations (order ignored) | nCr = n! / (r!(n − r)!) |
| Arrangements with repetition | n! / (p! q! r! …) for repeated items |
| Fundamental counting principle | total = (ways for step 1) × (ways for step 2) × … |
| Symmetry of combinations | nCr = nC(n − r) |
Circular & special
| Circular arrangement (n distinct) | (n − 1)! |
|---|---|
| Necklace / garland (reflections same) | (n − 1)! / 2 |
| Sum of all combinations | nC0 + nC1 + … + nCn = 2ⁿ |
| At least one selection (from n) | 2ⁿ − 1 |
| Relation P and C | nPr = nCr × r! |