Intuition The one core idea
Strong induction proves a statement is true for every whole number from some starting point onward, by allowing you to lean on all the earlier cases at once — not just the single one right before. Before you can read that machinery, you must first know exactly what each little symbol (P ( n ) , ≥ , k < n , ⇒ , ■ ) is pointing at — so this page builds them all from nothing.
This page is a toolbox . The parent note Strong induction freely uses symbols like P ( n ) , n 0 , k < n , ⇒ , ⟺ , ∀ , ab , a n , ■ . If any of those looks like a squiggle, read here first, then return.
Everything in this topic lives on the integers — the whole numbers with no fractions:
… , − 2 , − 1 , 0 , 1 , 2 , 3 , 4 , …
But strong induction almost always starts at some point and marches rightward forever . So the real playground is a line of evenly spaced dots stretching to the right with no end.
A integer is a whole number (no fractional part): … , − 1 , 0 , 1 , 2 , … . Picture: evenly spaced dots on a line.
Why the topic needs it: strong induction is a claim about each of infinitely many dots on this line — so we need the dots first.
The letter n is not a fixed number. It is a placeholder : a box you are allowed to drop any integer into.
Think of n as an empty chair. Sometimes an 8 sits in it, sometimes a 100 . When we write "for all n ", we mean "no matter which integer walks up and sits in the chair."
n
n = a symbol standing in for an unknown or arbitrary integer . Picture: a movable marker sliding along the number-line dots .
Why needed: we want to say one thing about all dots at once; n lets us talk about a general dot without naming it.
We rarely want all integers — usually only those from a starting dot rightward.
n ≥ n 0 reads "n is greater than or equal to n 0 ." Picture: n sits on or to the right of the dot n 0 .
k < n reads "k is strictly less than n ." Picture: k sits strictly to the left of n — never on top of it.
< with ≤
Why it feels the same: both mean "smaller-ish."
Why it matters here: the strong hypothesis is "P ( k ) for all k < n " with strict < . If you sloppily write k ≤ n you would be assuming P ( n ) — the very thing you must prove. The strictness is the whole game.
Definition The starting dot
n 0
n 0 (read "n -naught" or "n -zero") = the first integer you claim your statement holds for . Picture: the leftmost dot in the region we care about . In the prime example n 0 = 2 ; in the stamps example n 0 = 12 .
This is the heart of the whole topic. P ( n ) is not a number. It is a sentence about n that is either true or false once you pick an n .
Read P ( n ) as "the property P holds for n ." It's like a light bulb attached to each dot: green if the statement is true for that dot, red if false. Strong induction's job is to prove every bulb from n 0 rightward is green.
Examples of what P ( n ) can be:
P ( n ) : "n is a product of primes." Then P ( 6 ) is true (6 = 2 × 3 ), P ( 7 ) is true (7 is prime).
P ( n ) : "a n = 2 n − 1 ." Then P ( 3 ) is the claim "a 3 = 5 ."
P ( n )
P ( n ) = a ==statement about n that is true or false== once n is chosen. Picture: a coloured bulb sitting on the dot n — green = true, red = false.
Why needed: strong induction never talks about numbers directly; it talks about the truth of a claim at each dot. P ( n ) is that claim.
These little symbols are the grammar the proof is written in.
⇒
A ⇒ B reads "==if A is true, then B is true==" — "A forces B ." Picture: a domino A falling and knocking over domino B .
Why needed: the inductive step is one giant implication: (all earlier cases) ⇒ (the next case).
⟺
A ⟺ B reads "==A is true exactly when B is true==" — the two arrows both ways, A ⇒ B and B ⇒ A . Picture: two dominoes that always fall together.
Why needed: the parent note proves "strong induction ⟺ ordinary induction" — they have exactly the same power.
∀
∀ k reads "==for every k ==." Picture: a stamp pressed onto every dot in a range — nothing skipped.
Why needed: the strong hypothesis is "P ( k ) for all k < n " — the word "all" is this symbol.
Watch out: lowercase letters do two different things in the parent note.
(a) ab means multiplication. When you see n = ab , it means n equals a times b (the multiplication sign is invisible). Picture: a rectangle with side lengths a and b whose area is n .
(b) a n (with a subscript ) means "the n -th term of a sequence." The little n hanging below is an address , not a multiplier.
Definition Subscript / sequence term
a n
a n = the ==term in position n of a list of numbers== a 1 , a 2 , a 3 , … . Picture: a row of numbered boxes ; a n is whatever number sits in box number n .
Why needed: Worked Example 2 defines a n = 2 a n − 1 − a n − 2 — a rule building each box from earlier boxes. That's a recurrence , the natural home of strong induction.
a n as "a times n "
Why it feels right: ab does mean multiply, so a n looks similar.
Fix: the lowered position (subscript) changes everything — a n is "box number n ", never "a × n ". A subscript is an address label.
■
■ (also written Q.E.D.) = a mark meaning "the proof ends here; we have shown what we set out to show "." Picture: a full-stop for an argument.
The parent's flagship example (Prime Factorisation ) needs two words:
A prime is an integer ≥ 2 whose only positive divisors are 1 and itself (e.g. 2 , 3 , 5 , 7 , 11 ). Picture: a row of dots that refuses to form any rectangle other than 1 × n .
Definition Composite number
A composite is an integer ≥ 2 that is not prime — it splits as n = ab with 2 ≤ a , b < n . Picture: a dot-row that does fit into a proper rectangle (revisit figure s04).
Why needed: the proof splits into "prime" (stop) vs "composite" (break into two smaller pieces and recurse). Covering both cases is mandatory.
Integers - dots on a line
Variable n - sliding marker
Predicate P n - true or false bulb
Logic arrows => <=> for all
Subscript a n - numbered boxes
Product ab - rectangle area
Each foundation on the left must be solid before the arrow reaching Strong induction makes sense. If any box is fuzzy, reread its section above.
Symbol / idea
First used in parent for...
n 0 , ≥
"prove P ( n ) for all n ≥ n 0 "
k < n (strict)
the strong hypothesis
⇒ , ⟺
"strong induction ⟺ ordinary induction"
∀
"P ( k ) for all k < n "
n = ab
prime-factorisation step (Prime Factorisation )
a n subscript
the two-predecessor recurrence (Recurrence Relations )
prime / composite
the case split in Example 1
For the big picture that ties these together, keep Sequences & Series and Mathematical Induction (ordinary) open — the Well-Ordering Principle gives yet another lens on the same idea.
Read each question, answer out loud, then reveal:
What does n stand for, and why isn't it a fixed number? A movable placeholder for any integer — it lets us state one claim about all dots at once.
What is the difference between k < n and k ≤ n , and why does strong induction insist on the strict one? < excludes n itself; ≤ includes it. Strong induction must exclude n because P ( n ) is the conclusion, never an assumption.
What kind of object is P ( n ) — a number or a statement? A statement about n that is true or false; picture a green/red bulb on the dot n .
Read aloud what A ⇒ B and A ⟺ B mean. "A forces B " (one-way domino) and "A and B are always true together" (twin dominoes).
Does a n mean "a times n "? No — the subscript is an address : it means "the n -th term in a list a 1 , a 2 , … ".
What does n = ab mean, and what does it say about n ? n equals a × b ; if 2 ≤ a , b < n then n is composite (it fits a proper rectangle).
What is the difference between a prime and a composite number? A prime (≥ 2 ) has no divisors but 1 and itself; a composite splits as ab with both factors between 2 and n − 1 .
What does ■ mark? The end of a completed proof (Q.E.D.).
What is n 0 and where does it sit on the line? The starting integer of the claim — the leftmost dot of the region we care about.