← 🎲 Counting-Based Probability & Events
Subtopic 2 of 5

1.2Counting for probability: dice, cards, bags

The idea

To find those counts quickly, use products for independent steps and combinations C(n, k) when you pick items without caring about order.

Think of it like this: Choosing a committee: the order you name the members in does not matter, only who is in it.

Why it exists

Dice, bags of balls, socks, cards: all become "how many ways" questions. Combinations save you from listing everything.

How it works

  1. Independent steps multiply: three dice give 6 × 6 × 6 = 216 outcomes.
  2. Picking k items out of N with no regard to order: C(N, k) ways.
  3. "All different" with n dice: 6 × 5 × … (a permutation count) over 6ⁿ.
  4. "At least one" = 1 − P(none): often much shorter.
  5. Check that numerator and denominator count the same kind of outcome (both ordered or both unordered).

Worked example: GATE 2017: 3 red, 4 green, 3 blue socks; pick 2

Total pairs C(10, 2) = 45. Same colour: C(3,2) + C(4,2) + C(3,2) = 3 + 6 + 3 = 12. So P = 12/45 = 4/15. The bag lab shows the same three numbers.

Now play with it

  • →Set the bag to 3 red, 4 green, 3 blue and draw 2: confirm 4/15.
  • →Switch to "Rolling n dice" and find P(all different) for n = 6: it should be 5/324 ≈ 0.0154.
bag size N10
ways to draw kC(10, 2) = 45
P(all the same colour)12/45 = 0.2667
P(exactly 1 red)21/45 = 0.4667

Count favourable draws with combinations: choose the colour group(s), then divide by C(N, k). For 3 red, 4 green and 3 blue socks and 2 drawn: (3 + 6 + 3)/45 = 4/15, the GATE 2017 answer.

Check yourself

A bag has 4 red and 6 blue balls. Two are drawn together. What is P(both red)?

Remember: Count with C(n, k) for unordered picks and products for independent steps; "at least one" is 1 − P(none).
Exam notes (the dense version)

Count favourable and total outcomes with products (independent steps) and combinations C(n, k) (unordered choices). Drawing k items without replacement from N: total C(N, k). With replacement: Nk ordered outcomes. "At least one" is easiest as 1 − P(none).

Previous year questions: Counting-Based Probability & Events (17)

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