Permutations and Combinations · 0606 Topic 11

The Counting Principle

Teacher Rig, IGCSE Add Math tutor

Written by Teacher Rig

8 years teaching IGCSE Add Math · Updated 12 June 2026

Everything in permutations and combinations reduces to one principle: if a task happens in stages with mm choices then nn choices, the total is m×nm \times n. Factorials, nPr{}^nP_r and (nr)\binom{n}{r} are this principle pre-packaged, and when a question doesn’t fit a package, the principle itself, written as slots, always works.

The slot method

How many 4-digit numbers can be formed from the digits 1–7 without repetition? Draw four slots; fill in the choices: 7×6×5×4=8407 \times 6 \times 5 \times 4 = \mathbf{840}

The written slot product is both the thinking tool and the visible method, an examiner can award a slip-damaged answer that shows correct slots, and nothing at all to a bare wrong number.

Restrictions: most constrained slot first

How many of those 840 are even? Fill the constrained slot first, the last digit must be 2, 4 or 6: 3 choices. Remaining three slots from the six unused digits: 6×5×4=1206 \times 5 \times 4 = 120. Total: 120×3=360120 \times 3 = \mathbf{360}

Constraint-first ordering isn’t style; it’s correctness. Filling free slots first makes the constrained slot’s count depend on earlier choices, the count fractures into cases, and most students who try it double-count. Standard constraint types: fixed ends (“must start with a vowel”), parity (“even numbers”), forbidden positions, all yield to constrained-slot-first.

Multiply or add? The and/or test

Stages done in sequence (and) multiply. Mutually exclusive alternatives (or) add:

Digits from 1–7, 4-digit numbers greater than 5000: first digit 5, 6 or 7 (3 ways), then 6×5×46 \times 5 \times 4 for the rest → 3×120=3603 \times 120 = 360. One case. But “odd numbers greater than 5000” splits: first digit 5 or 7 overlaps the last-digit-odd constraint → handle as cases and add (first digit odd vs even), because the constraints interact.

The diagnostic before any arithmetic: do my constraints touch the same slots? If yes, split into cases, count each with slots, add.

Common mistakes

  • Free slots filled before constrained ones
  • Cases that should add being multiplied (and vice versa)
  • Repetition allowed/disallowed misread from the question
  • Interacting constraints handled as if independent
  • The slot product unwritten, method marks abandoned

Full topic context: P&C notes · the packages: factorials, nPr{}^nP_r, (nr)\binom{n}{r}.

Keep going

See the teaching work on your own child. Free. Then decide.

Every student starts with a free 1-hour class taught by Teacher Rig or the specialist your child would actually have. Real teaching, a diagnostic on real exam questions, and a straight answer on the gap to target. RM80/hr after that. No registration fee, no lock-in, online anywhere in Malaysia.