Find Sum of Series: 1² + 2² + 3² + ... + n² — Special Sum Formula

hard CBSE JEE-MAIN NCERT Class 11 Chapter 9 4 min read

Question

Find the sum of the series 12+22+32++n21^2 + 2^2 + 3^2 + \cdots + n^2.

In other words, prove that:

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

This formula carries guaranteed weightage in CBSE Class 11 board exams and appears as a stepping stone in JEE problems involving series manipulation.


Solution — Step by Step

We want a clever identity that brings k2k^2 into play. Use the cubic expansion:

(k+1)3k3=3k2+3k+1(k+1)^3 - k^3 = 3k^2 + 3k + 1

Why this particular identity? Because when we sum both sides over k=1k = 1 to nn, the left side telescopes — almost everything cancels. That’s the trick.

k=1n[(k+1)3k3]=k=1n(3k2+3k+1)\sum_{k=1}^{n} \left[(k+1)^3 - k^3\right] = \sum_{k=1}^{n} (3k^2 + 3k + 1)

The left side telescopes:

(2313)+(3323)++((n+1)3n3)=(n+1)31(2^3 - 1^3) + (3^3 - 2^3) + \cdots + ((n+1)^3 - n^3) = (n+1)^3 - 1

So we get:

(n+1)31=3k2+3k+1(n+1)^3 - 1 = 3\sum k^2 + 3\sum k + \sum 1

We already know k=1nk=n(n+1)2\displaystyle\sum_{k=1}^{n} k = \frac{n(n+1)}{2} and k=1n1=n\displaystyle\sum_{k=1}^{n} 1 = n.

Substituting:

(n+1)31=3S2+3n(n+1)2+n(n+1)^3 - 1 = 3S_2 + 3 \cdot \frac{n(n+1)}{2} + n

where S2=k2S_2 = \sum k^2 is what we want.

Expand (n+1)3=n3+3n2+3n+1(n+1)^3 = n^3 + 3n^2 + 3n + 1, so (n+1)31=n3+3n2+3n(n+1)^3 - 1 = n^3 + 3n^2 + 3n.

Now rearrange:

3S2=n3+3n2+3n3n(n+1)2n3S_2 = n^3 + 3n^2 + 3n - \frac{3n(n+1)}{2} - n 3S2=n3+3n2+2n3n(n+1)23S_2 = n^3 + 3n^2 + 2n - \frac{3n(n+1)}{2}

Factor nn from the first three terms:

3S2=n(n2+3n+2)3n(n+1)2=n(n+1)(n+2)3n(n+1)23S_2 = n(n^2 + 3n + 2) - \frac{3n(n+1)}{2} = n(n+1)(n+2) - \frac{3n(n+1)}{2}

Take n(n+1)n(n+1) common:

3S2=n(n+1)[(n+2)32]=n(n+1)2n+432=n(n+1)2n+123S_2 = n(n+1)\left[(n+2) - \frac{3}{2}\right] = n(n+1) \cdot \frac{2n+4-3}{2} = n(n+1) \cdot \frac{2n+1}{2}

Divide both sides by 3:

S2=n(n+1)(2n+1)6\boxed{S_2 = \frac{n(n+1)(2n+1)}{6}}

Why This Works

The telescoping method is the standard derivation you’ll see in NCERT and most board solutions. The key insight is that k3k^3 differences give us k2k^2 terms — we’re essentially “one degree up” to get what we want.

This mirrors how k\sum k is derived using (k+1)2k2=2k+1(k+1)^2 - k^2 = 2k + 1 (one degree up from kk). So for k3\sum k^3, we’d use (k+1)4k4(k+1)^4 - k^4. Same pattern, each time.

k=1n1=n\sum_{k=1}^{n} 1 = n k=1nk=n(n+1)2\sum_{k=1}^{n} k = \frac{n(n+1)}{2} k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6} k=1nk3=[n(n+1)2]2\sum_{k=1}^{n} k^3 = \left[\frac{n(n+1)}{2}\right]^2

Alternative Method: Induction

If derivation isn’t asked and you just need to verify the formula (common in JEE objective questions), Mathematical Induction is faster.

Base case: n=1n = 1. LHS =12=1= 1^2 = 1. RHS =1236=1= \frac{1 \cdot 2 \cdot 3}{6} = 1. ✓

Inductive step: Assume true for n=mn = m, i.e., k=1mk2=m(m+1)(2m+1)6\sum_{k=1}^{m} k^2 = \frac{m(m+1)(2m+1)}{6}.

For n=m+1n = m+1:

k=1m+1k2=m(m+1)(2m+1)6+(m+1)2\sum_{k=1}^{m+1} k^2 = \frac{m(m+1)(2m+1)}{6} + (m+1)^2 =(m+1)[m(2m+1)6+(m+1)]=(m+1)2m2+7m+66= (m+1)\left[\frac{m(2m+1)}{6} + (m+1)\right] = (m+1) \cdot \frac{2m^2 + 7m + 6}{6} =(m+1)(m+2)(2m+3)6= \frac{(m+1)(m+2)(2m+3)}{6}

This is exactly (m+1)((m+1)+1)(2(m+1)+1)6\frac{(m+1)((m+1)+1)(2(m+1)+1)}{6}. Induction complete. ✓

Induction is cleaner when you already know the formula — use it in objective settings to save time.


Common Mistake

Plugging in wrong value of nn. Students often compute 12+22++1021^2 + 2^2 + \cdots + 10^2 and use the formula with n=10n = 10, but then make the arithmetic error 1011216\frac{10 \cdot 11 \cdot 21}{6} incorrectly as 1011206\frac{10 \cdot 11 \cdot 20}{6} — forgetting the (2n+1)(2n+1) term uses 2(10)+1=212(10)+1 = 21, not 2n=202n = 20.

Always write out all three factors explicitly: nn, (n+1)(n+1), (2n+1)(2n+1) — then substitute. Don’t rush the substitution.

Quick sanity check: For n=3n = 3, we get 1+4+9=141 + 4 + 9 = 14. Formula gives 3476=14\frac{3 \cdot 4 \cdot 7}{6} = 14. If your formula gives a non-integer or something obviously wrong for small nn, you’ve made an error somewhere.

Want to master this topic?

Read the complete guide with more examples and exam tips.

Go to full topic guide →

Try These Next