Revision notes

Chapter 4 Combinatorics and Mathematical Induction: 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

Fundamental principles of counting

Sum rule or product rule?

  • Sum rule: add
    • Do ONE of the tasks
    • The tasks cannot happen together
    • Key word: or
    • 6 dosas or 4 idlis: 6 + 4 = 10
  • Product rule: multiply
    • Do ALL the stages, in turn
    • Each stage follows the previous one
    • Key word: and then
    • 3 buses and then 4 trains: 3 × 4 = 12
Ask: does the job finish after one choice, or after a chain of choices?

One task OR another: add. Stage AND THEN stage: multiply. Overlap counted twice: subtract it once. n objects into m places: mⁿ.

— The counting rules

Key takeaways: decide first whether the choices are alternatives (add) or stages (multiply). Fill the most restricted place first and split into cases when one place affects another, as with 0 in the leading place. Use inclusion-exclusion whenever two conditions can hold together.

Read the full lesson

Lesson 2

Factorials and permutations of distinct objects

Building ⁿPᵣ place by place

  1. Place 1: n choices Any of the n objects.
  2. Place 2: n − 1 choices One object is already used.
  3. Place 3: n − 2 choices Two objects are used.
  4. Place r: n − r + 1 choices r − 1 objects are used.
  5. Multiply ⁿPᵣ = n(n − 1)...(n − r + 1) = n!/(n − r)!
Properties, checked with numbers
PropertyCheck
ⁿPₙ = ⁿPₙ₋₁⁴P₄ = 24 and ⁴P₃ = 4 × 3 × 2 = 24
ⁿPᵣ = n × ⁽ⁿ⁻¹⁾Pᵣ₋₁⁶P₃ = 120 and 6 × ⁵P₂ = 6 × 20 = 120
ⁿPᵣ = ⁽ⁿ⁻¹⁾Pᵣ + r × ⁽ⁿ⁻¹⁾Pᵣ₋₁⁵P₂ = 20 and ⁴P₂ + 2 × ⁴P₁ = 12 + 8 = 20

n! = n × (n − 1)!, 0! = 1. ⁿPᵣ = n!/(n − r)! = n(n − 1)...(n − r + 1). With repetition: nʳ.

— Factorials and permutations

Key takeaways: simplify factorial expressions by writing the larger factorial down to the smaller and cancelling. ⁿPᵣ counts ordered arrangements of r out of n distinct objects; repetition turns the count into nʳ. To solve an equation in ⁿPᵣ, write both sides as products, cancel common factors and match consecutive numbers.

Read the full lesson

Lesson 3

Permutations with restrictions and repeated objects

Together or apart?

  • Always together: string method
    • Tie the m objects into one unit
    • Arrange n − m + 1 units
    • Arrange inside the unit: m!
    • m! × (n − m + 1)!
  • Never two together: gap method
    • Arrange the m free objects: m!
    • They make m + 1 gaps
    • Put the k objects in different gaps
    • m! × ⁽ᵐ⁺¹⁾Pₖ
Note: 'not all together' is total minus 'all together'; 'no two together' needs the gap method.

Together: m! × (n − m + 1)!. No two together: m! × ⁽ᵐ⁺¹⁾Pₖ. Alike objects: n!/(p₁! p₂! ... pₖ!).

— Restricted arrangements

Key takeaways: bundle objects that must be together and remember the arrangements inside the bundle; seat the free objects first and use the gaps for objects that must be apart; divide by p! for every group of p identical objects; and for a rank, count whole blocks of words that come before, one letter at a time.

Read the full lesson

Lesson 4

Combinations: selections and their properties

ⁿCᵣ = ⁿPᵣ / r! = n!/(r!(n − r)!) = n(n − 1)...(n − r + 1)/r!, for 0 ≤ r ≤ n.

— Number of combinations
Arrangement or selection?
SituationOrder matters: ⁿPᵣOrder does not matter: ⁿCᵣ
CricketBatting order of 11 from 15Team of 11 from 15
Prizes3 different prizes to 3 of 10 students3 identical prizes to 3 of 10 students
CommitteePresident and Secretary from 12 members2 members from 12
Choosing3 objects one after another, in order3 objects together, at once

Solving a selection problem

  1. Does order matter? Yes: permutation. No: combination.
  2. Split into groups Men and women, Part A and Part B, vowels and consonants.
  3. List the allowed cases For at least / at most, write each case or use total minus excluded cases.
  4. Multiply within a case, add across cases Product rule inside, sum rule between.
  5. Arrange if asked Multiply by r! (or the right arrangement count) only when the selection is then put in order.

Key takeaways: a combination is a selection, ⁿCᵣ = n!/(r!(n − r)!), and ⁿPᵣ = ⁿCᵣ × r!. Use ⁿCᵣ = ⁿCₙ₋ᵣ to shorten work and Pascal's rule to combine terms. For at least or at most, list the cases or subtract the forbidden ones. In geometry, collinear points reduce both the line count and the triangle count.

Read the full lesson

Lesson 5

The principle of mathematical induction

How induction reaches every n

  1. P(1) is checked directly The initial step.
  2. P(1) ⇒ P(2) The inductive step with k = 1.
  3. P(2) ⇒ P(3) The same step with k = 2.
  4. ... and so on for ever Each true statement passes truth to the next, so every P(n) is true.

Prove P(1) (or P(n₀)). Assume P(k), prove P(k + 1). Then P(n) is true for every n from the starting value on.

— The principle of mathematical induction

Key takeaways: write P(n) clearly, check the first value, and in the inductive step use the hypothesis P(k) openly; add the next term for a sum, substitute for the highest power in a divisibility proof, and compare carefully in an inequality. State the conclusion at the end.

Read the full lesson

Privacy · Terms · Refunds · Delivery