Summation Notation — Question 2

PDF ↗

Question 2

Prove that for any positive integer nn, ∑k=1nk2=n(n+1)(2n+1)6.\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}.

Original worksheet page 1: question and worked solution for 7-8-002
Show solutionHide solution

Question 2 - Solution

We prove the formula using mathematical induction.

Base Case:

For n=1n=1, ∑k=11k2=12=1,\sum_{k=1}^{1} k^2 = 1^2 = 1, and 1(1+1)(2⋅1+1)6=66=1.\frac{1(1+1)(2\cdot1+1)}{6}=\frac{6}{6}=1. Thus, the formula holds for n=1n=1.

Inductive Hypothesis:

Assume that for some positive integer nn, ∑k=1nk2=n(n+1)(2n+1)6.\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}.

Inductive Step:

Consider the sum up to n+1n+1: ∑k=1n+1k2=∑k=1nk2+(n+1)2.\sum_{k=1}^{n+1} k^2 = \sum_{k=1}^{n} k^2 + (n+1)^2.

Using the inductive hypothesis, ∑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 out (n+1)(n+1): ∑k=1n+1k2=(n+1)(n(2n+1)6+(n+1)).\sum_{k=1}^{n+1} k^2 = (n+1)\left(\frac{n(2n+1)}{6} + (n+1)\right).

Combine terms inside the parentheses: n(2n+1)+6(n+1)6=2n2+7n+66=(2n+3)(n+2)6.\frac{n(2n+1)+6(n+1)}{6} = \frac{2n^2+7n+6}{6} = \frac{(2n+3)(n+2)}{6}.

Thus, ∑k=1n+1k2=(n+1)(n+2)(2n+3)6.\sum_{k=1}^{n+1} k^2 = \frac{(n+1)(n+2)(2n+3)}{6}.

This matches the given formula with nn replaced by n+1n+1.

By mathematical induction, the formula holds for all positive integers nn.

∑k=1nk2=n(n+1)(2n+1)6\boxed{\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}}

Original worksheet page 2: question and worked solution for 7-8-002

Original worksheet layout. Use Enlarge or open the PDF for a closer view.