Summation Techniques — Sigma Notation and Telescoping

Learn summation techniques with clear explanations, worked examples, and practice problems.

CBSE JEE-MAIN NEET • 11 min read
Tags Summation And Series Techniques

Why Summation Matters

Adding up long sequences of numbers by hand is impractical. Summation techniques — sigma notation, standard formulas, and the telescoping method — let us find exact values of series that would otherwise take hours to compute.

The notation ∑k=1nk\sum_{k=1}^{n} k is a compact way of writing 1+2+3+⋯+n1 + 2 + 3 + \cdots + n. Once you are comfortable reading and manipulating sigma notation, evaluating series becomes a systematic process rather than guesswork.

JEE Main tests summation in 1-2 questions per year, often involving method of differences (telescoping) or using standard sum formulas. CBSE Class 11 covers sequence and series in Chapter 9, where these techniques appear directly.

Sigma Notation — Reading and Writing

The Greek letter Σ\Sigma (sigma) means “sum.” The expression

∑k=mnf(k)=f(m)+f(m+1)+f(m+2)+⋯+f(n)\sum_{k=m}^{n} f(k) = f(m) + f(m+1) + f(m+2) + \cdots + f(n)

reads as “the sum of f(k)f(k) as kk runs from mm to nn.”

The variable kk is a dummy variable — replacing it with any other letter gives the same sum.

Properties of Sigma Notation

∑k=1nc⋅f(k)=c∑k=1nf(k)(constant factor out)\sum_{k=1}^{n} c \cdot f(k) = c \sum_{k=1}^{n} f(k) \quad \text{(constant factor out)} ∑k=1n[f(k)±g(k)]=∑k=1nf(k)±∑k=1ng(k)(split the sum)\sum_{k=1}^{n} [f(k) \pm g(k)] = \sum_{k=1}^{n} f(k) \pm \sum_{k=1}^{n} g(k) \quad \text{(split the sum)} ∑k=1nc=n⋅c(sum of a constant)\sum_{k=1}^{n} c = n \cdot c \quad \text{(sum of a constant)}

The Standard Summation Formulas

These four formulas are the backbone of most summation problems:

Sum of first nn natural numbers:

∑k=1nk=n(n+1)2\sum_{k=1}^{n} k = \frac{n(n+1)}{2}

Sum of squares:

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

Sum of cubes:

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

Sum of a geometric series:

∑k=0n−1ark=a⋅rn−1r−1(r≠1)\sum_{k=0}^{n-1} ar^k = a \cdot \frac{r^n - 1}{r - 1} \quad (r \neq 1)

Notice that ∑k3=(∑k)2\sum k^3 = \left(\sum k\right)^2. This beautiful identity — the sum of cubes equals the square of the sum of natural numbers — is worth memorising. It often appears in JEE Main as a verification or a quick calculation.

Deriving the Formulas

Why ∑k=n(n+1)/2\sum k = n(n+1)/2

The classic method: write the sum forward and backward, then add:

S=1+2+3+⋯+nS = 1 + 2 + 3 + \cdots + n S=n+(n−1)+(n−2)+⋯+1S = n + (n-1) + (n-2) + \cdots + 1 2S=(n+1)+(n+1)+⋯+(n+1)=n(n+1)2S = (n+1) + (n+1) + \cdots + (n+1) = n(n+1) S=n(n+1)2S = \frac{n(n+1)}{2}

This is Gauss’s trick — he used it at age 8 to find 1+2+⋯+100=50501 + 2 + \cdots + 100 = 5050 in seconds.

Why ∑k2=n(n+1)(2n+1)/6\sum k^2 = n(n+1)(2n+1)/6

We use the telescoping approach with the identity (k+1)3−k3=3k2+3k+1(k+1)^3 - k^3 = 3k^2 + 3k + 1.

Sum from k=1k = 1 to nn:

∑[(k+1)3−k3]=3∑k2+3∑k+∑1\sum [(k+1)^3 - k^3] = 3\sum k^2 + 3\sum k + \sum 1

The left side telescopes to (n+1)3−13=n3+3n2+3n(n+1)^3 - 1^3 = n^3 + 3n^2 + 3n.

So: n3+3n2+3n=3∑k2+3⋅n(n+1)2+nn^3 + 3n^2 + 3n = 3\sum k^2 + 3 \cdot \frac{n(n+1)}{2} + n

Solving for ∑k2\sum k^2 gives n(n+1)(2n+1)6\frac{n(n+1)(2n+1)}{6}.

The Telescoping Method

Telescoping is the most powerful technique for evaluating sums where consecutive terms cancel. The key idea:

If we can write f(k)=g(k+1)−g(k)f(k) = g(k+1) - g(k), then:

∑k=1nf(k)=∑k=1n[g(k+1)−g(k)]=g(n+1)−g(1)\sum_{k=1}^{n} f(k) = \sum_{k=1}^{n} [g(k+1) - g(k)] = g(n+1) - g(1)

Most intermediate terms cancel (like the sections of a collapsing telescope).

Worked Example — Basic Telescoping

Evaluate ∑k=1n1k(k+1)\sum_{k=1}^{n} \frac{1}{k(k+1)}.

Step 1: Use partial fractions: 1k(k+1)=1k−1k+1\frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}

Step 2: Write out the telescoping sum:

∑k=1n(1k−1k+1)=(1−12)+(12−13)+⋯+(1n−1n+1)\sum_{k=1}^{n} \left(\frac{1}{k} - \frac{1}{k+1}\right) = \left(1 - \frac{1}{2}\right) + \left(\frac{1}{2} - \frac{1}{3}\right) + \cdots + \left(\frac{1}{n} - \frac{1}{n+1}\right)

Step 3: All intermediate terms cancel. We get:

=1−1n+1=nn+1= 1 - \frac{1}{n+1} = \frac{n}{n+1}

Method of Differences

When the general term TnT_n of a series can be expressed as f(n+1)−f(n)f(n+1) - f(n) for some function ff, the series telescopes. The method of differences formalises this:

  1. Express Tn=f(n+1)−f(n)T_n = f(n+1) - f(n)
  2. Sum: Sn=f(n+1)−f(1)S_n = f(n+1) - f(1)

Finding ff: If TnT_n is a polynomial in nn, compute first differences ΔTn=Tn+1−Tn\Delta T_n = T_{n+1} - T_n. If the differences eventually become constant, the sum can be found systematically.

Worked Example — Method of Differences

Find Sn=∑k=1nk(k+1)(k+2)S_n = \sum_{k=1}^{n} k(k+1)(k+2).

Trick: Write Tk=k(k+1)(k+2)T_k = k(k+1)(k+2).

Notice that k(k+1)(k+2)=14[(k+3)⋅k(k+1)(k+2)−(k−1)⋅k(k+1)(k+2)]k(k+1)(k+2) = \frac{1}{4}[(k+3) \cdot k(k+1)(k+2) - (k-1) \cdot k(k+1)(k+2)]… this gets messy.

Better trick (factorials method):

k(k+1)(k+2)=(k+3)!/(k−1)!4⋅4→useTk=(k+3)(k+2)(k+1)k−(k+2)(k+1)k(k−1)4⋅11k(k+1)(k+2) = \frac{(k+3)! / (k-1)!}{4} \cdot 4 \rightarrow \text{use} \quad T_k = \frac{(k+3)(k+2)(k+1)k - (k+2)(k+1)k(k-1)}{4} \cdot \frac{1}{1}

Actually, the cleanest way: recognise k(k+1)(k+2)=14[(k)(k+1)(k+2)(k+3)−(k−1)k(k+1)(k+2)]k(k+1)(k+2) = \frac{1}{4}[(k)(k+1)(k+2)(k+3) - (k-1)k(k+1)(k+2)].

This telescopes beautifully:

Sn=14[n(n+1)(n+2)(n+3)−0]=n(n+1)(n+2)(n+3)4S_n = \frac{1}{4}[n(n+1)(n+2)(n+3) - 0] = \frac{n(n+1)(n+2)(n+3)}{4}

The pattern: ∑k(k+1)=n(n+1)(n+2)3\sum k(k+1) = \frac{n(n+1)(n+2)}{3}, ∑k(k+1)(k+2)=n(n+1)(n+2)(n+3)4\sum k(k+1)(k+2) = \frac{n(n+1)(n+2)(n+3)}{4}. The denominator increases by 1 each time. This is related to combinations: ∑(kr)=(n+1r+1)\sum \binom{k}{r} = \binom{n+1}{r+1}.

Arithmetic-Geometric Series (AGP)

An arithmetic-geometric series has terms that are products of an arithmetic term and a geometric term:

S=a+(a+d)r+(a+2d)r2+⋯S = a + (a+d)r + (a+2d)r^2 + \cdots

Method: Multiply both sides by rr and subtract (the “multiply and subtract” trick).

For S=∑k=0n−1(a+kd)rkS = \sum_{k=0}^{n-1} (a + kd) r^k:

Multiply by rr: rS=∑k=0n−1(a+kd)rk+1rS = \sum_{k=0}^{n-1} (a + kd) r^{k+1}

Subtract: (1−r)S=a+d(r+r2+⋯+rn−1)−(a+(n−1)d)rn(1-r)S = a + d(r + r^2 + \cdots + r^{n-1}) - (a+(n-1)d)r^n

(1−r)S=a⋅1−rn1−r+dr(1−rn−1)(1−r)2−(a+(n−1)d)rn⋅(1−r)1−r(1-r)S = a \cdot \frac{1-r^n}{1-r} + \frac{dr(1-r^{n-1})}{(1-r)^2} - \frac{(a+(n-1)d)r^n \cdot (1-r)}{1-r}

For infinite AGP (∣r∣<1|r| < 1, n→∞n \to \infty):

S∞=a1−r+dr(1−r)2S_\infty = \frac{a}{1-r} + \frac{dr}{(1-r)^2}

Worked Example — Infinite AGP

Find S=1+3x+5x2+7x3+⋯S = 1 + 3x + 5x^2 + 7x^3 + \cdots for ∣x∣<1|x| < 1.

Terms: (2k−1)xk−1(2k-1)x^{k-1} for k=1,2,3,…k = 1, 2, 3, \ldots

Here a=1a = 1, d=2d = 2, r=xr = x.

S∞=a1−r+dr(1−r)2=11−x+2x(1−x)2S_\infty = \frac{a}{1-r} + \frac{dr}{(1-r)^2} = \frac{1}{1-x} + \frac{2x}{(1-x)^2} =(1−x)+2x(1−x)2=1+x(1−x)2= \frac{(1-x) + 2x}{(1-x)^2} = \frac{1+x}{(1-x)^2}

Solved Examples

Example 1 — CBSE Level

Find ∑k=110(3k2−2k+1)\sum_{k=1}^{10} (3k^2 - 2k + 1).

Solution:

=3∑k2−2∑k+∑1= 3\sum k^2 - 2\sum k + \sum 1 =3⋅10⋅11⋅216−2⋅10⋅112+10= 3 \cdot \frac{10 \cdot 11 \cdot 21}{6} - 2 \cdot \frac{10 \cdot 11}{2} + 10 =3⋅385−2⋅55+10=1155−110+10=1055= 3 \cdot 385 - 2 \cdot 55 + 10 = 1155 - 110 + 10 = \mathbf{1055}

Example 2 — JEE Main Level

Evaluate ∑r=1nr(r+1)!\sum_{r=1}^{n} \frac{r}{(r+1)!}.

Solution:

Write r(r+1)!=(r+1)−1(r+1)!=1r!−1(r+1)!\frac{r}{(r+1)!} = \frac{(r+1) - 1}{(r+1)!} = \frac{1}{r!} - \frac{1}{(r+1)!}.

This telescopes:

∑r=1n(1r!−1(r+1)!)=11!−1(n+1)!=1−1(n+1)!\sum_{r=1}^{n} \left(\frac{1}{r!} - \frac{1}{(r+1)!}\right) = \frac{1}{1!} - \frac{1}{(n+1)!} = 1 - \frac{1}{(n+1)!}

Example 3 — JEE Advanced Level

Sum to nn terms: 1⋅2+2⋅3+3⋅4+⋯1 \cdot 2 + 2 \cdot 3 + 3 \cdot 4 + \cdots

Solution:

Tk=k(k+1)=k2+kT_k = k(k+1) = k^2 + k

Sn=∑k2+∑k=n(n+1)(2n+1)6+n(n+1)2S_n = \sum k^2 + \sum k = \frac{n(n+1)(2n+1)}{6} + \frac{n(n+1)}{2} =n(n+1)6[(2n+1)+3]=n(n+1)(2n+4)6=n(n+1)(n+2)3= \frac{n(n+1)}{6}[(2n+1) + 3] = \frac{n(n+1)(2n+4)}{6} = \frac{n(n+1)(n+2)}{3}

Common Mistakes to Avoid

Mistake 1: Writing ∑k=1nk2\sum_{k=1}^{n} k^2 as (∑k=1nk)2\left(\sum_{k=1}^{n} k\right)^2. These are NOT equal. ∑k2≠(∑k)2\sum k^2 \neq (\sum k)^2. For example, 12+22=5≠(1+2)2=91^2 + 2^2 = 5 \neq (1+2)^2 = 9. The special identity is ∑k3=(∑k)2\sum k^3 = (\sum k)^2.

Mistake 2: Forgetting that telescoping only works when you correctly identify Tk=g(k+1)−g(k)T_k = g(k+1) - g(k). Always verify by expanding: write out 2-3 terms to confirm cancellation before concluding.

Mistake 3: In the method of differences for k(k+1)(k+2)k(k+1)(k+2), students try to expand and use ∑k3\sum k^3 and ∑k2\sum k^2 separately. This works but is very messy. The telescoping approach Tk=14[(k+3)k(k+1)(k+2)−(k−1)k(k+1)(k+2)]T_k = \frac{1}{4}[(k+3)k(k+1)(k+2) - (k-1)k(k+1)(k+2)] is cleaner.

Mistake 4: For AGP (arithmetic-geometric series), applying the standard geometric series formula directly. AGP needs the “multiply by rr and subtract” method — the standard GP formula does not work here.

Practice Questions

Q1. Find ∑k=1100k(k+1)\sum_{k=1}^{100} k(k+1).

∑k(k+1)=∑k2+∑k=100⋅101⋅2016+100⋅1012=338350+5050=343400\sum k(k+1) = \sum k^2 + \sum k = \frac{100 \cdot 101 \cdot 201}{6} + \frac{100 \cdot 101}{2} = 338350 + 5050 = 343400. Alternatively, use the formula n(n+1)(n+2)3=100⋅101⋅1023=343400\frac{n(n+1)(n+2)}{3} = \frac{100 \cdot 101 \cdot 102}{3} = 343400.

Q2. Evaluate ∑r=1n1(2r−1)(2r+1)\displaystyle\sum_{r=1}^{n} \frac{1}{(2r-1)(2r+1)}.

1(2r−1)(2r+1)=12(12r−1−12r+1)\frac{1}{(2r-1)(2r+1)} = \frac{1}{2}\left(\frac{1}{2r-1} - \frac{1}{2r+1}\right). This telescopes: 12(1−12n+1)=n2n+1\frac{1}{2}\left(1 - \frac{1}{2n+1}\right) = \frac{n}{2n+1}.

Q3. Find the sum S=1+2x+3x2+4x3+⋯S = 1 + 2x + 3x^2 + 4x^3 + \cdots (infinite series, ∣x∣<1|x| < 1).

Using the infinite AGP formula with a=1a=1, d=1d=1, r=xr=x: S=11−x+x(1−x)2=(1−x)+x(1−x)2=1(1−x)2S = \frac{1}{1-x} + \frac{x}{(1-x)^2} = \frac{(1-x)+x}{(1-x)^2} = \frac{1}{(1-x)^2}.

Q4. Evaluate ∑k=1nk3\displaystyle\sum_{k=1}^{n} k^3 for n=10n = 10 and verify using the “square of sum” identity.

∑k=110k3=(10⋅112)2=552=3025\sum_{k=1}^{10} k^3 = \left(\frac{10 \cdot 11}{2}\right)^2 = 55^2 = 3025. Verify: ∑k=55\sum k = 55, and 552=302555^2 = 3025. ✓

Q5. Sum to nn terms: 11⋅3+13⋅5+15⋅7+⋯\frac{1}{1 \cdot 3} + \frac{1}{3 \cdot 5} + \frac{1}{5 \cdot 7} + \cdots

Tr=1(2r−1)(2r+1)=12(12r−1−12r+1)T_r = \frac{1}{(2r-1)(2r+1)} = \frac{1}{2}\left(\frac{1}{2r-1} - \frac{1}{2r+1}\right). Telescopes to 12(1−12n+1)=n2n+1\frac{1}{2}\left(1 - \frac{1}{2n+1}\right) = \frac{n}{2n+1}.

Additional Techniques

Splitting the General Term

When the general term contains a product of consecutive integers, we can often express it as a difference of products with one extra factor. This is the generalised telescoping trick.

Pattern: k(k+1)⋯(k+r−1)=1r+1[(k+r)(k+r−1)⋯k−(k+r−1)(k+r−2)⋯(k−1)]k(k+1)\cdots(k+r-1) = \frac{1}{r+1}[(k+r)(k+r-1)\cdots k - (k+r-1)(k+r-2)\cdots(k-1)]

This means ∑k=1nk(k+1)=n(n+1)(n+2)3\sum_{k=1}^{n} k(k+1) = \frac{n(n+1)(n+2)}{3} and ∑k=1nk(k+1)(k+2)=n(n+1)(n+2)(n+3)4\sum_{k=1}^{n} k(k+1)(k+2) = \frac{n(n+1)(n+2)(n+3)}{4} — we proved the latter earlier.

Using Partial Fractions for Rational Series

For a series like ∑1(3k−2)(3k+1)\sum \frac{1}{(3k-2)(3k+1)}, always try partial fractions first:

1(3k−2)(3k+1)=13(13k−2−13k+1)\frac{1}{(3k-2)(3k+1)} = \frac{1}{3}\left(\frac{1}{3k-2} - \frac{1}{3k+1}\right)

This telescopes: 13(1−13n+1)=n3n+1\frac{1}{3}\left(1 - \frac{1}{3n+1}\right) = \frac{n}{3n+1}.

1k(k+1)=1k−1k+1→Sum=1−1n+1\frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1} \quad \to \quad \text{Sum} = 1 - \frac{1}{n+1} 1k(k+2)=12(1k−1k+2)→Sum=12(1+12−1n+1−1n+2)\frac{1}{k(k+2)} = \frac{1}{2}\left(\frac{1}{k} - \frac{1}{k+2}\right) \quad \to \quad \text{Sum} = \frac{1}{2}\left(1 + \frac{1}{2} - \frac{1}{n+1} - \frac{1}{n+2}\right) 1r!−1(r+1)!=r(r+1)!→Sum of r(r+1)!=1−1(n+1)!\frac{1}{r!} - \frac{1}{(r+1)!} = \frac{r}{(r+1)!} \quad \to \quad \text{Sum of } \frac{r}{(r+1)!} = 1 - \frac{1}{(n+1)!}

JEE Main 2023 had a question asking for ∑r=120r2+r+1(r+1)!\sum_{r=1}^{20} \frac{r^2 + r + 1}{(r+1)!}. The trick was to split r2+r+1=(r+1)2−r=(r+1)r+1r^2 + r + 1 = (r+1)^2 - r = (r+1)r + 1, then express as factorials that telescope. Recognising that the numerator can be decomposed into factorial-friendly terms is the pattern recognition skill that separates 90th percentile from 99th percentile students.

Q6. Find ∑k=1n1k(k+1)(k+2)\sum_{k=1}^{n} \frac{1}{k(k+1)(k+2)}.

Partial fractions: 1k(k+1)(k+2)=12(1k(k+1)−1(k+1)(k+2))\frac{1}{k(k+1)(k+2)} = \frac{1}{2}\left(\frac{1}{k(k+1)} - \frac{1}{(k+1)(k+2)}\right).

This telescopes: 12(11⋅2−1(n+1)(n+2))=12(12−1(n+1)(n+2))=n(n+3)4(n+1)(n+2)\frac{1}{2}\left(\frac{1}{1 \cdot 2} - \frac{1}{(n+1)(n+2)}\right) = \frac{1}{2}\left(\frac{1}{2} - \frac{1}{(n+1)(n+2)}\right) = \frac{n(n+3)}{4(n+1)(n+2)}.

FAQs

What is the difference between a sequence and a series? A sequence is an ordered list of numbers: 1,4,9,16,…1, 4, 9, 16, \ldots A series is the sum of the terms of a sequence: 1+4+9+16+⋯1 + 4 + 9 + 16 + \cdots Summation techniques apply to series.

When does a series converge? For infinite series, convergence means the partial sums approach a finite limit. Geometric series ∑ark\sum ar^k converges when ∣r∣<1|r| < 1. Harmonic series ∑1/k\sum 1/k diverges (sum grows without bound). For JEE, recognise that ∑1/k!\sum 1/k! converges to ee and ∑1/n(n+1)\sum 1/n(n+1) converges to 1.

How do I know when to use telescoping vs standard formulas? If the general term is a rational function (like 1k(k+1)\frac{1}{k(k+1)}), try partial fractions — it will telescope. If the general term is a polynomial in kk (like 3k2+2k3k^2 + 2k), use standard sum formulas. If it’s a product of consecutive integers (like k(k+1)(k+2)k(k+1)(k+2)), use the factorials/telescoping trick.

Can the sigma notation have a step other than 1? Yes, for example ∑k=1nf(2k)\sum_{k=1}^{n} f(2k) sums f(2),f(4),f(6),…f(2), f(4), f(6), \ldots But this is rarely tested in CBSE/JEE at the level we’ve covered here.

What’s the quickest way to memorise the ∑k2\sum k^2 formula? Think of it as three factors: nn, (n+1)(n+1), (2n+1)(2n+1) divided by 6. When n=1n = 1: 1⋅2⋅3/6=11 \cdot 2 \cdot 3 / 6 = 1. Check: 12=11^2 = 1. ✓ When n=2n = 2: 2⋅3⋅5/6=52 \cdot 3 \cdot 5 / 6 = 5. Check: 1+4=51 + 4 = 5. ✓ Practice with small values and the formula will stick.

How do I handle sums that start from k=0k = 0 instead of k=1k = 1? Simply evaluate the k=0k = 0 term separately and add it. For geometric series, starting from k=0k = 0 is natural: ∑k=0nark=a⋅rn+1−1r−1\sum_{k=0}^{n} ar^k = a \cdot \frac{r^{n+1} - 1}{r - 1}. For polynomial sums, the k=0k = 0 term is usually just a constant that you add at the end.

What is the difference between convergent and divergent series? A convergent series has partial sums that approach a finite limit as n→∞n \to \infty. A divergent series either grows without bound or oscillates without settling. For JEE, the key convergent series to know: ∑1/n2=π2/6\sum 1/n^2 = \pi^2/6, ∑1/n!=e\sum 1/n! = e, and ∑rn=1/(1−r)\sum r^n = 1/(1-r) for |r| &lt; 1. The harmonic series ∑1/n\sum 1/n diverges — even though terms approach zero, the sum grows without bound (slowly).