Revision notes

Chapter 6 Permutations and Combinations: Foundation

The key points, rules to remember, tables and diagrams from all 5 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

If an event can occur in m different ways, following which another event can occur in n different ways, then the two events in that order can occur in m × n ways. For three events with m, n and p ways, the count is m × n × p, and so on.

— Fundamental principle of counting (multiplication principle)

Counting by filling places

  1. Draw the places One box for each position to be filled.
  2. Fill restricted places first Units digit, first letter, and so on.
  3. Write the number of choices in each box Allow for repetition or not.
  4. Multiply By the fundamental principle.
Summary of the examples
SituationChoicesCount
4 kurtas, 3 dupattas4 × 312
3-letter words from 5 letters, no repeats5 × 4 × 360
3-letter words from 5 letters, repeats allowed5 × 5 × 5125
3-digit odd numbers from 1-6, repeats allowed3 × 6 × 6108
4 coin tosses2 × 2 × 2 × 216

Key takeaways: when choices are made one after another, multiply the number of ways at each stage. Without repetition the number of choices falls by one at each stage; with repetition it stays the same. Fill restricted places first, and add the counts of separate cases.

Read the full lesson

Lesson 2

Factorials and the permutation formula nPr

nPr = n!/(n − r)!, for 0 ≤ r ≤ n. In particular nPn = n! and nP0 = 1. With repetition allowed, n objects taken r at a time can be arranged in nʳ ways.

— Permutation formulas

Arranging r of n different objects

  • Without repetition
    • Choices fall: n, n − 1, ...
    • Count = nPr = n!/(n − r)!
    • Needs r ≤ n
    • Example: 5P3 = 60
  • With repetition
    • Choices stay n at each place
    • Count = nʳ
    • r can exceed n
    • Example: 5³ = 125
Factorials to remember (and 0! = 1)
n12345678
n!12624120720504040320

Key takeaways: n! = n × (n − 1)! and 0! = 1. The number of ordered arrangements of r out of n different objects is nPr = n!/(n − r)!, and with repetition it is nʳ. To solve an equation in nPr, write both sides as products, cancel the common factors and solve, keeping only natural-number answers that make sense.

Read the full lesson

Lesson 3

Permutations with identical objects and with conditions

The number of permutations of n objects, of which p₁ are of one kind, p₂ of a second kind, ..., pₖ of a k-th kind and the rest all different, is n!/(p₁! p₂! ... pₖ!).

— Permutations with identical objects

The block method

  1. Tie the objects into one block Treat the block as one object.
  2. Arrange the block with the rest Count these arrangements.
  3. Arrange inside the block Multiply by these arrangements.
  4. For 'not together', subtract Total minus together.
Summary
ArrangementWorkingCount
BANANA6!/(3! 2!)60
COMMITTEE9!/(2! 2! 2!)45360
PLANET, vowels together5! × 2!240
PLANET, vowels not together6! − 240480
4-digit numbers from 0-4, no repeats4 × 4 × 3 × 296

Key takeaways: divide by p! for every group of p identical objects. For objects that must be together, use a block and multiply by the arrangements inside it; for not together, subtract from the total. Handle a forbidden leading zero by filling the first place first, or by subtracting the arrangements that start with 0.

Read the full lesson

Lesson 4

Combinations: selections where order does not matter

Permutation or combination?

  • Permutation (arrangement)
    • Order matters
    • Words, numbers, seating, posts
    • AB ≠ BA
    • Count nPr
  • Combination (selection)
    • Order does not matter
    • Teams, committees, handshakes
    • AB = BA
    • Count nCr

nCr = n!/(r!(n − r)!), for 0 ≤ r ≤ n. Also nC0 = nCn = 1 and nCr = nC(n − r).

— Combinations
Some values of nCr (notice nCr = nC(n − r): 7C3 = 7C4)
nnC0nC1nC2nC3nC4
51510105
616152015
717213535
818285670

Key takeaways: ask whether order matters. If it does, count permutations; if not, count combinations. nCr = nPr/r! = n!/(r!(n − r)!). Use nCr = nC(n − r) to shorten calculations and Pascal's rule nCr + nC(r − 1) = (n + 1)Cr to combine terms.

Read the full lesson

Lesson 5

Mixed problems: selecting and arranging

Planning a counting problem

  • Does order matter?
    • Yes: permutations
    • No: combinations
    • Both: select, then arrange
  • Is there 'at least' or 'at most'?
    • List the possible cases
    • Count each case
    • Add the cases
  • Must objects be apart?
    • Arrange the others first
    • Place them in the gaps

Select first (nCr), then arrange (r!). For 'at least' or 'at most', list the cases and add. To keep objects apart, arrange the others and place them in the gaps.

— Strategy for mixed problems

Key takeaways: break a problem into steps and decide at each step whether order matters. Multiply for steps done one after another and add for separate cases. Check 'at least' answers with the complement when it is quicker. In dictionary problems, count whole blocks of words by their first letter before listing.

Read the full lesson

Privacy · Terms · Refunds · Delivery