Arithmetic Sequences and Series
Updated July 2026
Arithmetic Series
Arithmetic series, including the formula for the sum of the first n natural numbers.
In the TMUA/ESAT we expect you to know what an arithmetic series [and sequence] is and recognise one when it appears. We often refer to these as Arithmetic Progressions [APs] in the TMUA. You should also know and understand [i.e., be able to derive] the standard formulae and terminology:
first term=a
common difference=d
(nth term) un=a+(n−1)d
(sum to n terms) Sn=2n(2a+(n−1)d)=2n(a+a+(n−1)d)=2n(u1+un)
The last expression for the sum can be thought of as saying:
Sn=n×(2u1+un)=number of terms×average value of terms
And finally, it is useful to note that un+1−un=d.
We can create new arithmetic series by adding two [or more] series together:
Sn=a+(a+d)+(a+2d)+⋯+(a+(n−1)d)
Tn=A+(A+D)+(A+2D)+⋯+(A+(n−1)D)
And then we see that the sum is
Sn+Tn=a+A+(a+A+d+D)+(a+A+2(d+D))+⋯+(a+A+(n−1)(d+D))
which is the sum of an arithmetic sequence with first term a+A and common difference d+D.
(We will not test your ability to derive standard formulae in the TMUA/ESAT; but we would recommend, for your general mathematics education, that you know how to derive every formula in the TMUA/ESAT specification as the derivation will give you insights into the structure of the topic. And by "knowing how to derive" we don't mean that you have just learnt the derivation, the important point is understanding it.)
Exercise
We could also look at any linear combination of two such sequences: αun+βvn; verify these are also arithmetic sequences. Does this work for linear sums of more than two sequences [e.g., αun+βvn+γwn]?
There are lots of questions on arithmetic 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.