Step 1 of 18 · Worked example · TEACH

← Statistics & Probability

0 of 3 done

Work through the example to CHECK to open the problems.

Reach CHECK to open the problems.Higher Level · Statistics · Step 1

Count both, and explain why the two answers differ.

Five different students are available for three distinct roles: chairperson, secretary and treasurer. How many assignments are possible? Then: how many ways can three of the five be chosen for one undifferentiated team?

Permutations vs combinations

QuestionCountNotation
Roles (order matters)5 × 4 × 3 = 60⁵P₃ = 60
Team (order doesn't)60 ÷ 6 = 10⁵C₃ = 10
Bridge3! = 6internal orderings
Same 5 × 4 × 3 = 60; divide by 3! = 6 to remove internal orderings for a team.

Five different students are available for three roles: chairperson, secretary and treasurer.

(a) How many role assignments are possible?

(b) How many ways can three of the five be chosen for one team with no roles? Find the number of teams.

Read it once, slowly. Then copy it onto your page.
  • What is going on? Five different students. Three of them get picked, twice over, in two different ways.
  • (a) wants: the number of ways to fill three named roles. Each way is one role assignment.
  • (b) wants: one team of three, no roles. Count the teams. Same five students, a different count.
Céim

Higher Level Maths · Statistics & Probability · Step 1 of 18

Counting, Factorials, Permutations & Combinations

Counting outcomes starts with one question: does changing the order create a genuinely different result?

Why it matters

Every probability from an equally likely model needs a correct count of the sample space, so counting is the foundation of the whole strand.

The worked example

Five different students are available for three roles: chairperson, secretary and treasurer. (a) How many role assignments are possible? (b) How many ways can three of the five be chosen for one team with no roles? Find the number of teams.

How the worked example goes

  1. Read

    • What is going on? Five different students. Three of them get picked, twice over, in two different ways.
    • (a) wants: the number of ways to fill three named roles. Each way is one role assignment.
    • (b) wants: one team of three, no roles. Count the teams. Same five students, a different count.
  2. Understand

    • (a) Does the order matter?
    • Call the students A, B, C, D and E.
    • A chair, B secretary, C treasurer. Now swap A and B. Same three people, different jobs: a different assignment.
  3. Reduce

    • Fill the roles one at a time. Which count is right? 5 × 4 × 3 = 60: 5 for chair, then 4 left for secretary, then 3 left for treasurer.
    • (a) Where do I start?
    • With the first role. Write the choices for each role, then multiply: every chair goes with every secretary, and so on.
  4. Solve

    • (a) Multiply the choices.
    • 5 × 4 × 3 = 60
    • Written formally
  5. Check

    • (a) Is 60 sensible?
    • Fix A as chair. Then 4 choices for secretary and 3 for treasurer: 12. Five students could be chair: 5 × 12 = 60 ✓
    • It is less than 5 × 5 × 5 = 125, which allowed repeats, and less than 5! = 120, which filled five places ✓

Common mistakes to avoid

Key terms

factorial · arrangement · permutation · selection · combination · binomial coefficient