Mathematical Induction definition
Mathematical induction proves a statement for every integer from a starting value onward.
Mathematical Induction in a picture
How it works
First prove the base case. Then prove the inductive step: for an arbitrary k at or beyond the start, assume the statement holds at k and use that assumption to prove it at k + 1. The base case starts the chain, and the inductive step carries the result to every later integer.
Worked examples
Verify the base case of 1 + 2 + … + n = n(n + 1)/2 at n = 1.
Both sides are 1.
If the sum formula holds at k, add k + 1. What results?
k(k + 1)/2 + k + 1 = (k + 1)(k + 2)/2.
Can induction start at 0?
Yes, when the claim starts at 0.
Common mistake
Prove both parts. An inductive step without a valid base case gives no starting point.
Quick check
What is the first case called?
Show answer
The base case.
What do you assume in the inductive step?
Show answer
P(k) for an arbitrary allowed k.
What do you then prove?
Show answer
P(k + 1).
Sources
Flashcard
Mathematical Induction
Reveal the definition
Mathematical induction proves a statement for every integer from a starting value onward.
Effortless Math. “Mathematical Induction.” Math Dictionary.
