Induction in Calculus, Probability and Geometry
Using induction beyond sums and divisibility, to prove the power rule and formulas for nth derivatives, the binomial theorem and probability recursions, and geometric results such as polygon angle sums.
55 min · Proof
Assumes you have read Further Mathematical Induction.
The full teaching. Start here.
The short version
The structure is always the same: base case, hypothesis, step, conclusion. What changes is how you get from to :
- Derivatives: differentiate the th formula once more. For , use and the product rule.
- Binomial theorem: , then Pascal's rule combines the coefficients.
- Probability: write a recursion by conditioning on the last trial, then substitute the hypothesis.
- Geometry: build the case from the case, for example by cutting off a triangle, adding a vertex, or adding a line.
Calculus
The power rule for positive integers can be proved from the product rule alone.
Worked example3 marks
The power rule by induction
Prove that for all positive integers .
Base case
n = 1.
.
Hypothesis
Some positive integer k.
Assume .
Step
Write x^(k+1) as a product, not as a power, to avoid circularity.
.
Answer
This is the formula for , so by induction it holds for all positive integers .
Is that answer sensible?
: gives . Correct.
For th derivatives, the step is simply "differentiate the th derivative once more". Useful facts are , which gives , and careful tracking of signs and factorials for powers like .
CheckpointAnswer before reading on.
In proving by induction for positive integers , what is the base case?
Hint 1n = 1.
Hint 2.
Hint 3.
CheckpointAnswer before reading on.
Which fact is used in the inductive step of the proof of ?
Hint 1.
Hint 2Derivative of a product.
Hint 3Product rule.
CheckpointAnswer before reading on.
Which formula gives ?
Hint 1Each derivative shifts by .
Hint 2.
Hint 3Same pattern as sine.
CheckpointAnswer before reading on.
Using , find the value of the th derivative of at .
Hint 1Substitute n = 4.
Hint 2.
Hint 34.
Exam question
Standard · about 4 min
3 marks
Prove by induction that for all positive integers .
Hint 1Base n = 1.
Hint 2.
Hint 3.
Where students lose marks on this one
Differentiating x^(k + 1) directly with the power rule.
Why it happens: Circular.
Only the product rule and the hypothesis may be used.
Written for this site.
Exam question
Standard · about 4 min
3 marks
Prove by induction that for all positive integers .
Hint 1Base: product rule once.
Hint 2Differentiate .
Hint 3.
Where students lose marks on this one
Forgetting the e^x from differentiating (x + k).
Why it happens: Product rule error.
Two terms in the product rule.
Written for this site.
Exam question
Standard · about 4 min
3 marks
Prove by induction that for all positive integers .
Hint 1.
Hint 2Base: derivative is cos x.
Hint 3Differentiate .
Where students lose marks on this one
Using cos θ = sin(θ − π/2).
Why it happens: Wrong phase shift.
cos θ = sin(θ + π/2).
Written for this site.
Exam question
Harder · about 5 min
3 marks
Prove by induction that for all positive integers .
Hint 1Base: .
Hint 2Differentiate .
Hint 3Factor .
Where students lose marks on this one
Losing the sign.
Why it happens: Forgetting the −(k + 1) factor is negative.
It supplies both the extra factor and the sign change.
Written for this site.
Probability and the binomial theorem
Worked example4 marks
The binomial theorem by induction
Prove that for all positive integers .
Base case
n = 1.
.
Multiply out
Assume the result for n = k.
.
Collect x^(k+1−r) a^r
Two sources for each middle term.
For : from the first sum , and from the second (index ) . By Pascal's rule they total .
End terms
Pascal does not cover r = 0 or r = k + 1.
Only the first sum gives , with coefficient . Only the second gives , with coefficient .
Answer
, so by induction the theorem holds for all positive integers .
Is that answer sensible?
: . Correct.
Probability results often come from a recursion found by thinking about the last trial. For example, you have at least one six in rolls if you already had one, or if you had none and then roll a six: . Induction then proves the closed form.
CheckpointAnswer before reading on.
Which identity is the key to the inductive step of the binomial theorem?
Hint 1Two contributions to each coefficient.
Hint 2Pascal.
Hint 3.
CheckpointAnswer before reading on.
Using the binomial theorem with , find .
Hint 1.
Hint 2.
Hint 364.
CheckpointAnswer before reading on.
Using the recursion for the probability of at least one six, find P₂ to 4 decimal places.
Hint 1.
Hint 2.
Hint 3.
Exam question
Harder · about 6 min
4 marks
Prove by induction that for all positive integers . You may use .
Hint 1Base: n = 1.
Hint 2.
Hint 3Collect the coefficient of .
Where students lose marks on this one
Ignoring the first and last terms.
Why it happens: Pascal only covers middle terms.
Check r = 0 and r = k + 1 separately.
Written for this site.
Exam question
Standard · about 5 min
3 marks
Let be the probability of at least one six in rolls of a fair die. Explain why , and hence prove by induction that .
Hint 1Either already have a six, or get the first on roll n + 1.
Hint 2Base .
Hint 3Factor .
Where students lose marks on this one
Writing P_(n + 1) = P_n + 1/6.
Why it happens: Double counting.
A new six only matters if there was none before.
Written for this site.
Exam question
Harder · about 6 min
4 marks
A coin shows heads with probability . Let be the probability of an even number of heads (including zero) in tosses. (a) Show that . (b) Prove by induction that .
Hint 1Even after n + 1: even then tail, or odd then head.
Hint 2Base .
Hint 3Substitute and simplify.
Where students lose marks on this one
Forgetting the "odd then head" case.
Why it happens: Missing a route.
Two ways to end on an even count.
Written for this site.
Geometry
For polygons the base case is , a triangle. The step builds a -gon from a -gon.
Worked example4 marks
Polygon angle sums
Prove that the exterior angles of a convex -sided polygon () sum to .
Reduce to interior angles
Each exterior angle is 180° minus its interior angle.
Exterior sum , where is the interior sum. So it is enough to prove .
Base case
Triangle.
.
Step
Assume the result for convex k-gons.
In a convex -gon, the diagonal lies inside because the polygon is convex. It splits the polygon into triangle and the convex -gon . So .
Exterior angles
Substitute.
Exterior sum .
Answer
By induction for all , so the exterior angles sum to .
Is that answer sensible?
A square: four exterior angles of sum to . A regular hexagon: six of also sum to .
CheckpointAnswer before reading on.
When proving a result for all convex n-sided polygons by induction, what is the usual base case?
Hint 1Smallest polygon.
Hint 2Three sides.
Hint 3n = 3.
CheckpointAnswer before reading on.
In the polygon angle-sum proof, why is convexity needed?
Hint 1What does the diagonal do?
Hint 2Inside or outside?
Hint 3Non-convex polygons can have diagonals outside.
CheckpointAnswer before reading on.
Find the sum of the interior angles of a convex octagon, in degrees.
Hint 1.
Hint 2n = 8.
Hint 36 × 180.
CheckpointAnswer before reading on.
How many diagonals does a convex decagon have?
Hint 1.
Hint 2n = 10.
Hint 310 × 7 ÷ 2.
CheckpointAnswer before reading on.
Five lines in general position (no two parallel, no three concurrent). How many regions?
Hint 1.
Hint 2n = 5.
Hint 332 ÷ 2.
Exam question
Harder · about 6 min
4 marks
Prove by induction that the interior angles of a convex -sided polygon sum to for , and hence that its exterior angles sum to .
Hint 1Base: triangle.
Hint 2Cut off a triangle with a diagonal.
Hint 3Exterior angle = 180° − interior.
Where students lose marks on this one
Not mentioning convexity.
Why it happens: Missing why the diagonal lies inside.
Convexity guarantees V₁V₃ is inside.
Written for this site.
Exam question
Harder · about 5 min
3 marks
Prove by induction that a convex -gon () has diagonals.
Hint 1Base: triangle has 0.
Hint 2New vertex adds k − 2 diagonals, plus one old side becomes a diagonal.
Hint 3.
Where students lose marks on this one
Forgetting the old side V_kV₁ becomes a diagonal.
Why it happens: Undercounting by 1.
Check with a square: 2 diagonals.
Written for this site.
Exam question
Harder · about 5 min
3 marks
straight lines are drawn in the plane so that no two are parallel and no three meet at a point. Prove by induction that they divide the plane into regions.
Hint 1Base: 1 line, 2 regions.
Hint 2New line crosses k lines at k distinct points.
Hint 3k + 1 pieces, each splitting a region.
Where students lose marks on this one
Saying the new line adds k regions.
Why it happens: Counting points, not pieces.
k points cut a line into k + 1 pieces.
Written for this site.
Common mistake
To prove d/dx(xⁿ) = nxⁿ⁻¹: d/dx(xᵏ⁺¹) = (k + 1)xᵏ by the power rule.
Why it happens: That uses the result you are trying to prove.
The step may only use the hypothesis (for ) and other known facts, such as the product rule. Writing is what makes the hypothesis usable.
What lifts this to a Band 6
In geometric and probability induction, the marks are mostly for the explanation of the step, not the algebra. Say in words how the case is made from the case ("the new line crosses each of the lines once, at distinct points, so it is cut into pieces"). An argument that states the recursion without justifying it usually loses a mark.
Induction on integrals
Integrals with a parameter can also be handled by induction, usually combined with integration by parts. For example, . The base case is . For the step, integration by parts gives . This shows how the factorial extends to a function of a continuous variable (the gamma function), and it links this lesson to the reduction formulas in the calculus topic.