Foundation to VCE • Explore the maths library • Try a free sample
VCE Specialist Mathematics Units 1–2 · Discrete mathematics

Teach combinatorics and counting proofs.

Use permutations for ordered arrangements and combinations for unordered selections. Repeated identical objects reduce the number of distinct arrangements.

View worksheets & preview

Aspire to Power Learning · https://resources.aspiretopowerlearning.com.au/home-learning/topics/specialist-1-2-combinatorics/

Check the starting point

  • Calculate factorials, permutations and combinations.
  • Recognise disjoint cases and overlapping sets.

Show the idea

Separate ordered and unordered selections

TaskCalculationCount
Two-person committee from 5C(5,2)10
President and secretary from 5P(5,2)20
Ratio2! orders per committee2

The same two people make one committee but two role assignments. Decide whether order or roles distinguish the outcomes before calculating.

Work through an example

How many distinct arrangements of the letters in LEVEL are possible?

  1. If all five letters were distinct there would be 5!=120 arrangements.
  2. The two L letters are identical, so swapping them does not create a new arrangement. Divide by 2! to remove that double-counting.
  3. The same applies independently to the two E letters. Hence the count is 5!/(2!×2!)=120/4=30.

Answer: 30.

Teach in small steps

  1. Read the visual model together: The same two people make one committee but two role assignments. Decide whether order or roles distinguish the outcomes before calculating.
  2. Model this example aloud: How many distinct arrangements of the letters in TATTOO are there? Guide: There are 6 letters, with T repeated 3 times and O twice: 6!/(3!2!). Result: 60.
  3. Let your learner choose the steps for a new situation: A club has 12 members. How many committees of 4 contain a particular member? Ask which part of the model or rule carries over before checking the worked solution.
  4. After a short break, ask for an independent response: If |A|=28, |B|=19 and |A∩B|=8, find |A∪B|. Compare both the method and conclusion with the checkpoint answers, then revisit any misconception.

Ask and listen

  • Choose a captain and vice-captain from 8 people. How many assignments are possible?
  • Explain combinatorially why C(n,r)=C(n,n−r).

Adapt the practice

More support

Start with this prerequisite: Calculate factorials, permutations and combinations. Keep the visual visible. For the first guided problem, focus on this step: There are 6 letters, with T repeated 3 times and O twice: 6!/(3!2!).

More challenge

Try this application without looking at its answer: How many people guarantee at least 4 share a birth month? Then explain why the answer fits the stated domain or context.

Look for understanding

  • Your learner can complete this checkpoint and explain the method: If |A|=28, |B|=19 and |A∩B|=8, find |A∪B|.
  • Your learner can justify or challenge this statement/question using the mathematical definitions: Explain combinatorially why C(n,r)=C(n,n−r).

Choose the next step

If either checkpoint needs prompting, repeat the worked model with changed values and revisit this caution: Order matters for permutations but not combinations. When both are secure, use the linked Apply and extend resource and relevant VCE Key Knowledge/Key Skills activity.

Put the idea into practice

The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.

Explore this topic’s worksheets