Maths WorkshopMaths problems with full solutions
Exercise 500Logic, sets and proofs › Proof techniques › InductionHigh schoolAdded 3 Nov 2026

Sum of squares by induction

#induction#sum of squares#integers

Statement

Prove by induction that ∑k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n}k^2=\frac{n(n+1)(2n+1)}{6} for all n≥1n\ge1.

Hint

Base case n=1n=1; inductive step: add (n+1)2(n+1)^2 and simplify.

Show solutionHide solution

Solution

Base case. n=1n=1: 1=1⋅2⋅36=11=\frac{1\cdot2\cdot3}{6}=1. ✓

Inductive step. Assume the formula for nn. Then
∑k=1n+1k2=n(n+1)(2n+1)6+(n+1)2.\sum_{k=1}^{n+1}k^2=\frac{n(n+1)(2n+1)}{6}+(n+1)^2.
Factor (n+1)(n+1):
=(n+1)[n(2n+1)+6(n+1)]6=(n+1)(2n2+n+6n+6)6=(n+1)(2n2+7n+6)6.=\frac{(n+1)[n(2n+1)+6(n+1)]}{6}=\frac{(n+1)(2n^2+n+6n+6)}{6}=\frac{(n+1)(2n^2+7n+6)}{6}.
Factor 2n2+7n+6=(n+2)(2n+3)2n^2+7n+6=(n+2)(2n+3):
=(n+1)(n+2)(2n+3)6.=\frac{(n+1)(n+2)(2n+3)}{6}.
This is the formula for n+1n+1.

Conclusion. By induction, the formula holds.