Free degree-level computing lessons for careful independent study.
Aplailasain by Static Carnival

Degree Level Programmes · Formal Computing Foundations · Lesson 14

Permutations, Combinations and Binomial Reasoning

Choose the right counting method when order may or may not matter.

Back to coursePreviousNext lesson

Lesson overview

Choose the right counting method when order may or may not matter.

CourseFundamentals of Computing
Topic strandCombinatorics
Assessment styleDigital exam practice
EvidenceWorked answer plus justification

Starter: make the model explicit

Before reading the worked example, write down the objects involved, the claim being made and the notation you expect to use. This prevents the common error of calculating before modelling.

Learning objectives

  • Distinguish permutations from combinations.
  • Calculate small selection counts.
  • Use binomial coefficients in simple cases.

Learning outcomes

  • By the end of this lesson, you can distinguish permutations from combinations.
  • By the end of this lesson, you can calculate small selection counts.
  • By the end of this lesson, you can use binomial coefficients in simple cases.

Key vocabulary

permutationcombinationfactorialbinomial coefficient

What this lesson is about

Permutations count selections where order matters. Combinations count selections where order does not matter. Binomial reasoning counts how choices split across two categories.

The lesson is about selecting the correct counting model. The same objects can produce different counts depending on whether positions, roles or order are meaningful.

Terms, acronyms and named methods

These are the phrases and named techniques used in this lesson. Read this section before the worked example so the notation and examples have a clear meaning.

PermutationNamed counting idea. An ordered selection. Use it when positions or roles matter.
CombinationNamed counting idea. An unordered selection. Use it when only membership of the selected group matters.
FactorialPhrase. For a positive integer n, n! means n × (n−1) × ... × 2 × 1.
Binomial coefficientNamed expression. The number C(n,r), also written as n choose r, counts unordered selections of r items from n.

Formal notation and definitions

P(n, r) = n!/(n − r)! when order matters.C(n, r) = n!/(r!(n − r)!) when order does not matter.(a + b)ⁿ = Σᵣ C(n, r)aⁿ⁻ʳbʳ.

How to read the symbols

P(n,r)P(n,r)Number of ordered selections of r objects from n.
(nr)\binom{n}{r}Number of unordered selections of r objects from n.
n!n!Factorial: n(n-1)(n-2)...1.

Use permutation notation when positions matter and combination notation when only group membership matters.

Degree-level reasoning

Counting arguments are proofs about structure. The result is only valid if the cases are exhaustive and counted exactly once.

A degree-level answer explains why order matters or does not matter, and why choices are independent or constrained.

Do not stop at a correct-looking answer. State why the method is valid, whether the result depends on a hidden assumption, and what would count as a counterexample.

Worked formal model

This section shows the model, notation, calculation and interpretation as one worked answer. The notation is part of the reasoning, not decoration.

1. Context and objects

Choosing 3 testers from 10 is a combination if the team has no order; assigning first, second and third reviewer roles is a permutation.

Objects: the 10 testers, the selected group of 3, and the reviewer roles that may or may not impose order.

Model cue: Use two panels: ordered slots for permutations and an unordered group for combinations. The visual distinction is whether position carries meaning.

2. Mathematical working

(103)=10!3!7!=120\binom{10}{3} = \frac{10!}{3!7!} = 120P(10,3)=10!7!=720P(10,3) = \frac{10!}{7!} = 720720=120⋅3!720 = 120\cdot 3!
Plain text version
C(10, 3) = 10!/(3!7!) = 120 unordered teams
P(10, 3) = 10!/7! = 720 ordered role assignments
720 = 120 * 3!, because each unordered team has 3! possible role orders

3. How to read the working

  1. Decide whether order matters before choosing a formula.
  2. Use a combination when the selected group has no named positions.
  3. Use a permutation when the positions or roles are distinct.
  4. Compare the answers: the ordered count is larger because each unordered team can be arranged in multiple role orders.

4. Computing meaning and check

The count depends on whether positions carry meaning. Reviewer roles are ordered; an unlabelled team is not, so using the wrong formula systematically overcounts or undercounts.

Now check: For 8 students, compare the number of unordered project teams of 3 with ordered presentation slots of 3. Explain the difference.

Worked example

From scenario to formal reasoning

Scenario: Choosing 3 testers from 10 is a combination if the team has no order; assigning first, second and third reviewer roles is a permutation.

Method: Use the definitions and notation introduced above, then state what the result means in this computing scenario.

Reveal model answer

Choosing 3 reviewers from 10 is C(10,3) because the group has no internal order. Assigning chair, first reviewer and second reviewer is P(10,3) because each position has a different meaning.

Worked solution structure

How a strong answer should be written

  1. Define: State the domain and the objects under discussion. For this lesson, begin from P(n, r) = n!/(n − r)! when order matters.
  2. Apply: Use the relevant definition from combinatorics; do not rely on the diagram, wording or intuition alone.
  3. Check: Test a boundary case, counterexample candidate or representation limit.
  4. Conclude: Write one sentence that connects the formal result back to the computing scenario.

Common misconception

A common mistake is counting the same group several times because order was included when the problem did not require it.

Guided practice

  1. Compute C(8,3) for unordered project teams of 3 from 8 students.
  2. Compute P(8,3) for ordered presentation slots and compare the two counts.
  3. Explain why the permutation count is 3! times the combination count in this case.
  4. Use a binomial coefficient to count the ways to choose 2 security tests from 5 possible tests.

Quick checks

1. Which count is appropriate for an unordered team of 3 from 8?

2. Why is P(8,3) larger than C(8,3)?

Digital exam practice

Example exam task

For 8 students, compare unordered teams of 3 with ordered presentation slots of 3. Use C(8,3), P(8,3), and explain the role of 3!.

Notation toolkit

(nr)\binom{n}{r}

Means: choose r objects from n when order does not matter

How to use: Use it for unordered teams or selections.

P(n,r)P(n,r)

Means: arrange r objects from n when positions matter

How to use: Use it for ordered slots or named roles.

r!r!

Means: the number of ways to order r selected objects

How to use: Use it to explain why permutations exceed combinations.

What a good answer is expected to show

A strong answer for this lesson defines the 10 testers, the selected group of 3, and the reviewer roles that may or may not impose order, applies the combinatorics method with visible working, and finishes by interpreting the result in the computing scenario.

How to solve it

  1. Decide whether order matters before choosing a formula.
  2. Use a combination when the selected group has no named positions.
  3. Use a permutation when the positions or roles are distinct.
  4. Compare the answers: the ordered count is larger because each unordered team can be arranged in multiple role orders.

Model answer

Reveal model answer
(83)=8!3!5!=56\binom{8}{3}=\frac{8!}{3!5!}=56P(8,3)=8!5!=336P(8,3)=\frac{8!}{5!}=336P(8,3)=(83)⋅3!P(8,3)=\binom{8}{3}\cdot3!

Unordered teams of 3 from 8 students are counted by C(8,3) = 8!/(3!5!) = 56. Ordered presentation slots are counted by P(8,3) = 8!/5! = 336. The ordered count is 3! times larger because each team can be arranged in 6 slot orders.

Practise next

  1. Compute C(8,3) for unordered project teams of 3 from 8 students.
  2. Compute P(8,3) for ordered presentation slots and compare the two counts.

Self-marking criteria

  • Chooses combination for unordered teams.
  • Chooses permutation for ordered slots.
  • Calculates or sets up both formulae correctly.
  • Explains overcounting by 3!.
  • Uses binomial coefficient notation accurately.

Extension

Change one assumption in the worked scenario and decide whether the same method still applies. If it does not, name the exact point where the reasoning breaks.

Study route

Save one clean worked answer from this lesson. Include the problem statement, notation, working, final answer and a short note explaining the computing meaning of the result.

Next lesson: Semester 1 Consolidation and Digital Exam Practice.