40% off

Ends 15 Aug

Lock in £90

Geometric Series Summation

Updated July 2026

Geometric Series

The sum of a finite geometric series. The sum to infinity of a convergent geometric series, including the use of r<1|r| < 1.

In the TMUA/ESAT we expect you to know what a geometric series [and sequence] is and recognise one when it appears. We often refer to these as Geometric Progressions [GPs] in the TMUA. You should also know and understand the standard formulae and terminology:

first term =a= a [sometimes this is written as ar0ar^0 to fit in with the formula for unu_n]

common ratio=r\text{common ratio} = r

(nth term) un=arn1\text{(nth term) } u_n = ar^{n-1}

sum to n terms Sn=a(1rn)1r\text{sum to n terms } S_n = \frac{a(1 - r^n)}{1 - r}

sum to infinity S=a1rvalid when r<1\text{sum to infinity } S_\infty = \frac{a}{1 - r} \quad \text{valid when } |r| < 1

And you should be comfortable using Σ\Sigma notation and GPs:

Sn=k=1nark1=k=0n1arkS_n = \sum_{k=1}^{n} ar^{k-1} = \sum_{k=0}^{n-1} ar^k

Note how we have written the same expression in two different ways using the notation. (Whilst it takes some time to get used to Σ\Sigma notation, you should make some effort to be fluent using it as it will appear frequently during your higher studies and it will usually be assumed you are familiar with it and can manipulate it easily. You might eventually encounter expression with sums of sums ΣΣ\Sigma \Sigma and even sums of sums of sums ΣΣΣ\Sigma \Sigma \Sigma etc.)

There are some additional useful formulae/techniques you should keep in mind:

The ratio of adjacent terms is fixed: un+1un=r\frac{u_{n+1}}{u_n} = r so un+1un=unun1\frac{u_{n+1}}{u_n} = \frac{u_n}{u_{n-1}} etc.

You can derive new progressions from a given GP. Given

Sn=a+ar+ar2+ar3+ar4+ar5S_n = a + ar + ar^2 + ar^3 + ar^4 + ar^5 \dots \dots \dots

then we can replace rr by r-r to get

Sn(r)=aar+ar2ar3+ar4ar5S_{n}(-r) = a - ar + ar^{2} - ar^{3} + ar^{4} - ar^{5} \dots \dots \dots

and we note that Sn(r)S_{n}(-r) is also a GP with first term aa and common ratio r-r and

S=a1+rS_{\infty} = \frac{a}{1 + r}

Using this, we can also create other GPs. Consider this progression:

12(Sn+Sn(r))=a+ar2+ar4+ar6\frac{1}{2} \left( S_{n} + S_{n}(-r) \right) = a + ar^{2} + ar^{4} + ar^{6} \dots \dots \dots

Which is a GP with u1=au_{1} = a and a common ratio of r2r^{2}. What is its sum to infinity?

You can also explore 12(SnSn(r))\frac{1}{2} \left( S_{n} - S_{n}(-r) \right).

And we can generate new GPs by raising each term in SnS_{n} to a power. Here are some examples:

Example 1

Square every term:

Sn(squared)=a2+a2r2+a2r4+a2r6+S_{n}(squared) = a^{2} + a^{2}r^{2} + a^{2}r^{4} + a^{2}r^{6} + \dots \dots \dots

So Sn(squared)S_{n}(squared) is a GP with u1=a2u_{1} = a^{2} and a common ratio of r2r^{2}.

What is SS_{\infty} (squared)?

Example 2

Raise every term to power of kk [we will assume kk is a positive integer]:

Sn(power is k)=ak+akrk+akr2k+akr3k+S_n(\text{power is } k) = a^k + a^k r^k + a^k r^{2k} + a^k r^{3k} + \cdots \dots \dots

Verify that Sn(power is k)S_n(\text{power is } k) is also a GP. What can you say about S(power is k)S_\infty(\text{power is } k) when r<1|r| < 1? What happens if kk is any positive number? And what about if k<0k < 0 and 0<r<10 < r < 1?

We can also look at sum of part of a GP. Given

Sk=a+ar+ar2+ar3+ar4++ark1S_k = a + ar + ar^2 + ar^3 + ar^4 + \cdots + ar^{k-1}

find an expression for arm+arm+1++arnar^m + ar^{m+1} + \cdots + ar^n [where we assume n>mn > m].

When exploring these sorts of expression, you have to be very careful with the ends of the sequence as it can be easy to write the wrong thing when simplifying. For instance, it is tempting to write this expression as SnSmS_n - S_m but that would be wrong [why?]. And also, for instance, we might ask how many terms are there in the sum arm+arm+1++arnar^m + ar^{m+1} + \cdots + ar^n? Is it nmn - m terms? (No! It is nm+1n - m + 1 terms. Can you see why? This is an example of the fence post error – it is very easy to make this error, so explore what it is and think about how you would avoid making it when answering questions.)

There are lots of ways of tackling this sum and how you approach it might depend on how the problem you are dealing with is set up:

Method 1

Treat is as the difference of two sums:

arm+arm+1++arn=Sn+1Smar^m + ar^{m+1} + \cdots + ar^n = S_{n+1} - S_m

Note the n+1n + 1 in Sn+1S_{n+1}.

Method 2

Factorise out rmr^m and treat what is in the bracket as a simple GP with u1=au_1 = a and common ratio rr and number of terms nm+1n - m + 1:

arm+arm+1++arn=rm(a+ar++arnm)ar^{m} + ar^{m+1} + \cdots + ar^{n} = r^{m}(a + ar + \cdots + ar^{n-m})

Or even better, factorise out armar^{m}:

arm+arm+1++arn=arm(1+r++rnm)ar^{m} + ar^{m+1} + \cdots + ar^{n} = ar^{m}(1 + r + \cdots + r^{n-m})

Method 3

Treat it as a new GP with first term armar^{m} and common ratio rr and number of terms nm+1n - m + 1:

arm+arm+1++arn=arm+(arm)r+(arm)r2++(arm)rnmar^{m} + ar^{m+1} + \cdots + ar^{n} = ar^{m} + (ar^{m})r + (ar^{m})r^{2} + \ldots + (ar^{m})r^{n-m}

Exercise

For each of the above methods, work out the sum and verify all three methods give you the same answer. This is more an exercise in being careful than anything else – you should not skip this exercise thinking you can do it easily!

There are lots of questions on geometric sequences in the TMUA/ESAT past papers. We recommend you work through the past papers first [initially under timed conditions] and if you get stuck, study the detailed worked answers we have supplied for each TMUA/ESAT paper.

Ready to test your knowledge?

You've reached the end of this section. Start a practice session to solidify your understanding and master this topic.