Counting Principles
Before any permutation or combination formula makes sense, you need the two rules that everything in counting rests on: the multiplication principle and the addition principle. They sound trivial — "and means multiply, or means add" — but CAT, XAT and SNAP repeatedly reward students who can decompose a messy real-world question into independent stages (multiply) or mutually exclusive cases (add) without reaching for a formula at all. A surprising share of "P&C" questions are really pure counting: how many passwords, how many number plates, how many functions from one set to another, how many ways to seat people with a constraint. The smart approach is to fill positions one at a time, count the choices at each position, and decide at every step whether the next decision is a continuation of the same task (multiply) or a fresh alternative path (add). This chapter builds that decision-making instinct. It covers the fundamental principle of counting, the multiplication principle for sequential independent choices, the addition principle for disjoint cases, the case-analysis method for constrained problems, the standard counting models (functions, passwords, number plates, digit problems), and the indispensable at-least-one technique: count the complement (none) and subtract from the total. Master these and the entire P&C chapter becomes a set of named shortcuts rather than a wall of formulas.
Topics
⚡ CAT shortcuts & speed methods
The fastest ways to crack this chapter under time pressure — the techniques that separate a 95+ percentiler from the rest.
- Translate the language first: "AND" / "then" ⇒ multiply; "OR" with no overlap ⇒ add. Get this right and the arithmetic is trivial.
- Slots method: draw one blank per decision, write the choice-count in each, multiply. For "no repetition" each later slot loses one option.
- Fill the most constrained slot first (e.g. units digit must be even, leading digit cannot be 0) so constraints never collide later.
- r positions each with n free choices (repetition allowed) ⇒ nʳ. This single model covers passwords, PINs, strings, functions (nᵐ) and dice rolls.
- r-digit numbers with no leading zero ⇒ 9 × 10^(r−1); for "all distinct digits" use 9 × 9 × 8 × 7 … starting from the leading slot.
- At-least-one is almost always faster as total − none. Compute the complement (zero of the thing) and subtract.
⚠️ Common mistakes & traps
CAT is designed so that careless errors here cost you marks. Internalise each trap before the exam.
- Adding when you should multiply (or vice versa) — sequential stages multiply; exclusive alternatives add.
- Using the addition principle on cases that overlap, which double-counts; switch to A + B − both (inclusion–exclusion).
- Forgetting the no-leading-zero rule, so the first digit slot gets 10 choices instead of 9.
- Reversing the function model: maps from A (m elements) to B (n elements) is nᵐ, not mⁿ — each of the m inputs has n choices.
- Computing "at least one" by trying to add the one-case, two-case, three-case totals instead of doing total − none.
📈 CAT exam insight & PYQ analysis
🎴 Flashcards — instant recall
Tap a card to reveal the answer. Drill these until they are automatic.
📌 Quick revision
Chapter test
🏆 Vidaara CAT success checklist
You have truly mastered Counting Principles when you can tick every box below.
- Recall every formula in this chapter without looking them up
- Solve each topic’s practice set with at least 80% accuracy
- Use the chapter shortcuts to cut your solving time in half
- Spot and avoid every common trap listed above
- Score 80%+ on the timed chapter test
📋 Chapter mastery scorecard
Track where you stand. Aim for the target before moving to the next chapter.
| Skill checkpoint | Target |
|---|---|
| Concept theory & formulas understood | 100% |
| Topic practice sets attempted (3 topics) | 3/3 |
| Best topic-test score | — → 80%+ |
| Chapter test score | — → 80%+ |
| Flashcards drilled to instant recall | 12 cards |
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ʳ |