← 🎲 Counting & Probability
Subtopic 2 of 5

4.2Repetition, selection & distribution

The idea

Selection with repetition counts multisets: C(n + k − 1, k). Restrictions are best handled by inclusion-exclusion.

Think of it like this: Choosing scoops of ice cream: you can take the same flavour twice.

Why it exists

Distribution and "no one gets a disliked item" questions appear regularly.

How it works

  1. k scoops from n flavours: C(n + k − 1, k).
  2. List the tuples (counts of each flavour) to check.
  3. For restricted permutations: total − bad + both bad.
  4. Check against a small case.

Worked example: 3 scoops from 4 flavours

C(6, 3) = 20.

Now play with it

  • →List the 20 tuples in the lab.
  • →Use the inclusion-exclusion tile for the shirts problem.
Ways, C(flavours + scoops − 1, scoops)20
Listed below20
0,0,0,30,0,1,20,0,2,10,0,3,00,1,0,20,1,1,10,1,2,00,2,0,10,2,1,00,3,0,01,0,0,21,0,1,11,0,2,01,1,0,11,1,1,01,2,0,02,0,0,12,0,1,02,1,0,03,0,0,0

Each tuple says how many scoops of flavour 1, 2, 3, ... you take. Order does not matter, only the counts do.

All assignments n!24
Bad cases for person 1 (A)6
Bad cases for person 2 (B)6
Both bad together2
Good = total − bad + both14

Inclusion-exclusion for the shirts problem: 24 − 6 − 6 + 2 = 14.

Check yourself

Number of non-negative solutions of x + y + z = 4

Remember: Multiset: C(n + k − 1, k). Restrictions: total − bad + both.
Exam notes (the dense version)

Choosing k items from n types with repetition and no order: C(n + k − 1, k) (3 scoops from 4 flavours = C(6,3) = 20). This equals the number of non-negative solutions of x₁ + ... + xₙ = k (stars and bars). With each item used at most once it is plain nCk. Handle restrictions by complement or by inclusion-exclusion (24 − 6 − 6 + 2 = 14).

Previous year questions: Counting & Probability (10)

PYQs are grouped by topic, so this is the full set for Counting & Probability; try the ones that match this subtopic. Open all 10 on the topic page.