Addition Principle
The addition principle handles alternatives: if a task can be completed by method A OR by method B, and the two methods share no outcome (mutually exclusive), the total number of ways is the sum. The trigger word is "OR". The non-negotiable condition is disjointness — the two cases must not overlap, or you will double-count. CAT loves problems that look like one task but split into clean cases: "a 3-digit number that is either divisible by 5 or has all even digits", or "the committee has exactly 2 men OR exactly 3 men". The standard CAT technique, called counting by cases, is to break a constrained problem into mutually exclusive sub-problems, count each by the multiplication principle, and add. When cases can overlap, switch to inclusion–exclusion (A + B − both); but if you choose your cases to be naturally exclusive, plain addition is enough and far faster.
✅ 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
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ʳ |