CAT Quant · Chapter Test
Counting Principles — 25-Question Test
A fresh, mixed-difficulty set drawn from the whole chapter — questions you haven't been asked before. Auto-graded with full solutions; your result is saved to your dashboard.
Building your 25-question test…
Formula Reference Sheet
This chapter
The two principles
| Multiplication principle (AND) | If stage 1 has m ways and stage 2 has n ways, the task has m × n ways |
|---|---|
| Addition principle (OR, exclusive) | If a task is done by method A (m ways) OR method B (n ways), disjoint, total = m + n |
| k independent stages | n₁ × n₂ × … × n_k ways |
| Choices each from r boxes (repetition allowed) | nʳ (n options, r positions) |
Standard counting models
| Functions from A (m elements) to B (n elements) | nᵐ |
|---|---|
| r-digit numbers, no leading zero, repetition allowed | 9 × 10^(r−1) |
| Subsets of an n-element set | 2ⁿ |
| At-least-one | (total arrangements) − (arrangements with none) |
| r-letter strings from an n-letter alphabet | nʳ |
CAT reference
🖩 Graphing Calculator