Integrated Mathematics 2 · Topic 6.3 · Unit 6 · CA CCSS S-CP.9

Permutations, combinations and counting

Name:   Date:  

1 Why this lesson matters

Read the opening paragraph and the "The method" box on the lesson page. In your own words, restate each idea below.

Fundamental counting principle: independent choices multiply. Four shirts and three trousers give \( 4 \times 3 = 12 \) outfits.

Order matters → permutation. \( {}_nP_r = \frac{n!}{(n-r)!} \). Use it for finishing positions, rankings, passwords, arrangements in a row, and assigning distinct roles.

Order does not matter → combination. \( {}_nC_r = \frac{n!}{r!(n-r)!} \). Use it for committees, teams, hands of cards, and choosing a subset.

The test: would swapping two chosen items give a different outcome? A first and second place is different when swapped, so permutation. Two people on the same committee is not, so combination.

Combinations are always smaller than the matching permutation, by a factor of \( r! \). If your combination answer exceeds the permutation, they are the wrong way round.

2 Worked example

Read the "Worked example" box. Then, without looking back, try writing your own answer below.

Example 1: permutation. Eight runners race. How many ways can gold, silver and bronze be awarded?

3 Sum it up

In two or three sentences, explain this lesson's main idea to someone who has not read it.