Series

Take a sequence — a numbered list of terms like 3,5,7,9,113, 5, 7, 9, 11 — and add the terms instead of just listing them, and you get a series. That single shift, from listing to adding, is the idea this whole chapter is built on: every result about Arithmetic Progressions and Geometric Progressions you will meet next is really a statement about a series and its running total. To talk about that running total precisely, mathematicians use two tools: the partial sum SnS_n, the value of the sum after nn terms, and sigma notation, ∑k=1nak\sum_{k=1}^n a_k, a compact shorthand for writing a long addition. This article builds both tools from scratch, shows how they let you recover any term of a sequence from its sums alone, and works two full examples so the mechanics become automatic before you meet AP and GP sums.

The core insight

A series is the running addition of a sequence's terms, and its nn-th partial sum SnS_n both compresses that addition into one number and, through an=Sn−Sn−1a_n = S_n - S_{n-1}, lets you reconstruct the individual terms back out of it.

The core idea

A sequence is a list, a1,a2,a3,…a_1, a_2, a_3, \dots; a series is what you get when you replace the commas with plus signs:

a1+a2+a3+⋯+an+…a_1 + a_2 + a_3 + \dots + a_n + \dots

where: each aka_k is a term of the underlying sequence. If the list stops after nn terms the series is finite; if it continues forever it is infinite. The distinction matters because a series and its value are two different things — the series is the indicated addition, while its value, once you actually add up the first nn terms, is called the partial sum.

Partial sums carry all the information. The sum of the first nn terms is written SnS_n:

Sn=a1+a2+⋯+anS_n = a_1 + a_2 + \dots + a_n

where: SnS_n is a single number, the nn-th partial sum. Because SnS_n already contains Sn−1S_{n-1} inside it — everything except the last term — subtracting recovers that last term exactly:

an=Sn−Sn−1(n≥2),a1=S1a_n = S_n - S_{n-1} \quad (n \ge 2), \qquad a_1 = S_1

where: the n≥2n \ge 2 restriction exists because S0S_0, the sum of zero terms, is not a defined partial sum here, so a1a_1 must be read off separately as S1S_1 itself.

Sigma notation compresses the addition. Instead of writing out every term, the capital Greek letter Σ\Sigma ("sum") does the work:

∑k=1nak=a1+a2+⋯+an\sum_{k=1}^{n} a_k = a_1 + a_2 + \dots + a_n

where: kk is the index of summation, starting at the lower limit 11 and running up to the upper limit nn; aka_k is the rule for the kk-th term. Reading a sigma expression is a two-step habit — first identify the rule aka_k, then plug in every integer kk from the lower to the upper limit and add. Three standard sums built from this notation turn up throughout the chapter as quick-reference facts rather than results you are asked to re-derive on demand:

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

where: nn is the number of terms summed and kk runs from 11 to nn in each case. Once a sequence turns out to be a specific type — an AP or a GP — these general series ideas specialise into the familiar sum formulae Sn=n2[2a+(n−1)d]S_n = \tfrac{n}{2}[2a+(n-1)d] for an AP and Sn=a(rn−1)r−1S_n = \tfrac{a(r^n-1)}{r-1} for a GP, which the rest of the chapter is devoted to.

Figure
Five bars for the terms 3 5 7 9 11 stacking up to a running total of 35
Partial sums build up as terms are added 3S1=3 5S2=8 7S3=15 9S4=24 11S5=35 bar height = term value; label below = running partial sum after that term
Derivation AGauss's pairing proof that the sum of the first n natural numbers is n times n plus one over two

The goal is to prove the standard summation formula ∑k=1nk=n(n+1)2\sum_{k=1}^n k = \dfrac{n(n+1)}{2} used throughout this chapter, using nothing more than a clever pairing of terms rather than induction, so that the result feels earned rather than memorised, and so that the same pairing trick is available later whenever a symmetric series needs summing quickly.

Step 1. Write the sum S=1+2+3+⋯+(n−1)+nS = 1 + 2 + 3 + \dots + (n-1) + n twice, once forwards and once backwards, and place the two copies one under the other so matching positions line up: the top row reads 1,2,3,…,n1, 2, 3, \dots, n and the bottom row reads n,n−1,n−2,…,1n, n-1, n-2, \dots, 1.

Step 2. Add the two rows column by column. The first column gives 1+n1 + n, the second gives 2+(n−1)=n+12 + (n-1) = n+1, the third gives 3+(n−2)=n+13 + (n-2) = n+1, and every column keeps producing the same value n+1n+1, because whatever a term loses by counting up from 11, its partner gains by counting down from nn.

Step 3. There are nn columns in total (one for each of the nn terms), and every column contributes n+1n+1, so adding both rows together gives 2S=n(n+1)2S = n(n+1), since the two rows together are just S+SS + S.

Step 4. Divide both sides by 22 to isolate the single sum: S=n(n+1)2S = \dfrac{n(n+1)}{2}, which is exactly ∑k=1nk\sum_{k=1}^n k. Check it on a small case: for n=5n = 5, the formula gives 5×62=15\frac{5 \times 6}{2} = 15, and indeed 1+2+3+4+5=151+2+3+4+5 = 15, confirming the pairing argument.

Worked example

Problem. Write the series ∑k=15(2k+1)\displaystyle\sum_{k=1}^{5} (2k+1) in expanded form and find its value; then, for a second sequence whose partial sums are known to be Sn=3n2+2nS_n = 3n^2 + 2n, find its first four terms.

Step 1 — expand the sigma notation. Substitute k=1,2,3,4,5k = 1, 2, 3, 4, 5 into the rule 2k+12k+1: this gives 3,5,7,9,113, 5, 7, 9, 11, so the series is 3+5+7+9+113+5+7+9+11.

Step 2 — add the terms. 3+5=83+5=8, then 8+7=158+7=15, then 15+9=2415+9=24, then 24+11=3524+11=35, so

∑k=15(2k+1)=35\sum_{k=1}^{5}(2k+1) = 35

Step 3 — find a1a_1 for the second sequence directly, since a1=S1a_1 = S_1: a1=S1=3(1)2+2(1)=5a_1 = S_1 = 3(1)^2+2(1) = 5.

Step 4 — use an=Sn−Sn−1a_n = S_n - S_{n-1} for the rest. S2=3(4)+2(2)=16S_2 = 3(4)+2(2) = 16, so a2=16−5=11a_2 = 16-5 = 11. S3=3(9)+2(3)=33S_3 = 3(9)+2(3) = 33, so a3=33−16=17a_3 = 33-16 = 17. S4=3(16)+2(4)=56S_4 = 3(16)+2(4) = 56, so a4=56−33=23a_4 = 56-33 = 23.

Final answer. ∑k=15(2k+1)=35\displaystyle\sum_{k=1}^{5}(2k+1) = \mathbf{35}, and the second sequence's first four terms are 5,11,17,23\mathbf{5, 11, 17, 23} — note the constant common difference of 66, a preview of how an AP's terms behave.

Common traps

  • Confusing a series with its sum. The series is the indicated addition a1+a2+…a_1+a_2+\dots; SnS_n is its numerical value. Mixing the two words up causes muddled proofs.
  • Wrong limits in sigma notation. Starting the index at k=0k=0 instead of k=1k=1, or stopping one term short or long, silently changes the answer.
  • Using an=Sn−Sn−1a_n = S_n - S_{n-1} at n=1n=1. This only works for n≥2n \ge 2, since S0S_0 is not defined; a1a_1 must always be found separately as a1=S1a_1 = S_1.
  • Treating ∑k\sum k, ∑k2\sum k^2, ∑k3\sum k^3 as exam-derivation targets. At this level they are background facts to quote and use, not results you are expected to prove from scratch, unless a question explicitly asks for the proof.

Ask the tutor: if you want more practice converting between expanded sums and sigma notation, or extracting terms from a given SnS_n formula, ask the AI tutor for extra worked problems.

Why doesn't an equal Sn minus Sn minus one work for n equal to 1?

Because that formula relies on Sn−1S_{n-1} being a defined partial sum, and S0S_0 would mean the sum of zero terms, which this chapter never defines. So there is nothing to subtract from S1S_1. Instead, a1a_1 is read off directly: since S1S_1 is by definition the sum of just the first term, S1=a1S_1 = a_1. Always compute a1a_1 this way first, then use the subtraction formula only from n=2n=2 onward — this two-case habit avoids a very common off-by-one error.

Do I need to memorise the sum k, sum k squared and sum k cubed formulae, or can I derive them every time?

At this stage you should be able to recall them instantly, the way you recall a multiplication table, because problems in this chapter use them as tools rather than testing their proofs. That said, knowing at least one derivation, such as the Gauss pairing trick for ∑k\sum k, is valuable insurance: if a question ever does ask you to justify the formula, or if you simply forget a coefficient under exam pressure, being able to rebuild it from the pairing argument in under a minute means you are never stuck.

Whats the real difference between a sequence and a series, since they look so similar?

A sequence is a list — terms kept separate, like 3,5,7,9,113, 5, 7, 9, 11 with commas between them; you can ask "what is the fourth term" and get a single term back. A series is that same list with plus signs instead of commas, 3+5+7+9+113+5+7+9+11, and you can ask "what is the sum of the first four terms" and get a partial sum back. Every series is built from a sequence, but a series is fundamentally about accumulation, while a sequence is about position. Keeping this distinction sharp is what makes SnS_n versus ana_n notation make sense.

Before this

Where this leads