Revision notes

Permutations and Combinations: Foundation

The key points, rules to remember, tables and diagrams from all 9 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

The fundamental principle of counting

Stages one after another (AND): multiply. Separate alternatives (OR): add. Fill any restricted place first.

The multiplication principle counts tasks done in stages: multiply the ways at each stage. The addition principle counts either-or choices: add them. Repetition allowed keeps the number of choices the same at every stage; repetition not allowed reduces it by one each time. Conditions are handled by filling the restricted place first. In the next lesson we give the repeated multiplications n × (n − 1) × ... a short name, the factorial.

Read the full lesson

Lesson 2

Factorials and permutations of distinct objects

n! = n × (n − 1) × ... × 2 × 1, with 0! = 1. ⁿPᵣ = n!/(n − r)! = n(n − 1)...(n − r + 1), the arrangements of r out of n different objects.

Quick reference
ExpressionMeaningValue
5!Arrange 5 different objects120
8!/6!Cancel to 8 × 756
⁷P₃Arrange 3 of 7210
⁶P₄Arrange 4 of 6360

n! is the product from n down to 1, and 0! = 1. Arranging all n different objects gives n! ways. Arranging r of them gives ⁿPᵣ = n!/(n − r)!, which is the product of r numbers counting down from n. Cancel factorials before multiplying. In permutations order always matters; the next lesson adds conditions and repeated objects.

Read the full lesson

Lesson 3

Arrangements with conditions and repeated letters

Fixed object: place it first. Objects together: bundle them, arrange, then multiply by the arrangements inside the bundle. n objects with p alike, q alike, ...: n!/(p! q! ...).

Words with repeated letters
WordLettersRepeatsArrangements
LETTER6T 2, E 2180
BANANA6A 3, N 260
APPLE5P 260
ALLAHABAD9A 4, L 27560

Handle a fixed object by placing it first. Handle objects that must be together by bundling them and multiplying by their inside arrangements. For identical objects, divide n! by the factorial of each repeat count. Always tally the letters before applying the formula. The next lesson moves from arrangements, where order matters, to selections, where it does not.

Read the full lesson

Lesson 4

Combinations: counting selections

ⁿCᵣ = n!/(r!(n − r)!) and ⁿPᵣ = r! × ⁿCᵣ. ⁿCᵣ = ⁿCₙ₋ᵣ. If ⁿCₐ = ⁿC_b with a ≠ b, then a + b = n.

A combination is a selection where order does not matter. ⁿCᵣ = n!/(r!(n − r)!) and it equals ⁿPᵣ divided by r!. Use ⁿCᵣ = ⁿCₙ₋ᵣ to shorten calculations and to solve ⁿCₐ = ⁿC_b. Handshakes, lines through points and triangles from points are all selections. The last lesson combines selections with arrangements and conditions.

Read the full lesson

Lesson 5

Selection and arrangement together

Select from each group separately and multiply. Select then arrange: multiply by r!. Included: fix the person and choose the rest. At least one: total minus none.

Break every counting problem into stages and multiply. Use C for each choice where order does not matter, and multiply by the arrangements of the chosen objects when order then matters. A person who must be included is placed first; one who must be excluded is removed. "At least one" is total minus none, and can be checked by adding the exact cases. The final self-assessment now tests all five lessons.

Read the full lesson

Lesson 6

Repetition allowed: the nʳ rule and which number is the base

Each position (or each person) makes one choice from n options, and repeats are allowed: the count is nʳ, where n is the number of options and r the number of choosers.

ProblemChoosersOptions eachCount
4 letters are posted, each into one of 3 letter-boxes4 letters3 boxes3⁴ = 81
3 people each choose one of 4 trains3 people4 trains4³ = 64

Key takeaways: repeats allowed gives nʳ; n is the number of options for one chooser, r the number of choosers; "no repeat" turns the count into n(n − 1)(n − 2)…; the number with at least one repeat is the total minus the no-repeat count.

Read the full lesson

Lesson 7

Pascal's rule, the symmetry rule and solving equations with ⁿCᵣ

ⁿCᵣ + ⁿCᵣ₋₁ = ⁿ⁺¹Cᵣ. Two neighbouring entries on one row of Pascal's triangle add up to the entry below them.

Key takeaways: use symmetry to shorten calculations; Pascal's rule adds neighbours; ⁿCₓ = ⁿCᵧ means x = y or x + y = n; solve quadratics and reject negative or fractional n and r.

Read the full lesson

Lesson 8

Choosing any number of items: subsets and the 2ⁿ rule

n different items give 2ⁿ selections of any size (including none) and 2ⁿ − 1 selections of at least one item.

Key takeaways: each different item is in or out, so 2ⁿ selections of any size; subtract 1 to exclude the empty selection; a compulsory item removes one factor 2; for identical items the count is n or n + 1, not 2ⁿ.

Read the full lesson

Lesson 9

Forming numbers from digits: first steps

Fill the place with the restriction first. Otherwise the choices for later places depend on what you did earlier, and counting becomes messy.

Key takeaways: one box per place; fill the restricted place first; the first digit can never be 0; for even numbers split into cases when 0 is among the digits; with repetition each later place keeps all its choices.

Read the full lesson

Privacy · Terms · Refunds · Delivery