This site is a work in progress. New lessons are added regularly.
Contact us
Arithmetic Sequences and Series
Learning goals
Test for a constant difference d throughout
Apply an=a1+(n−1)d, counting steps not terms
Recover d from two terms by dividing rise by steps
Count terms with n=dL−a1+1
Prove Sn=2n(a1+an) by reversing and adding
Read a quadratic Sn backwards to recover d
What makes a sequence arithmetic
A sequence is a function on the positive integers, so an is the output at input n. That function
can do anything at all. An arithmetic sequence is one that does the simplest possible thing: it
adds the same number every time you advance the input by one.
A sequence a1,a2,a3,… is arithmetic when there is a fixed number d, the common
difference, with
an+1−an=dfor every n≥1,
which is the same as the recursive rule an+1=an+d. The word common is doing real work
here: the difference must be the same for every pair of neighbours, not just the first pair you
happen to check.
Three quick examples and two non-examples make the definition concrete:
4,9,14,19,… is arithmetic with d=5 (each term is five more than the one before).
20,13,6,−1,… is arithmetic with d=−7. A negative d is perfectly legal; the sequence
simply runs downhill.
3,3,3,3,… is arithmetic with d=0. It is a dull sequence, but it satisfies the
definition, and the formulas below for the nth term and for the sum will handle it without
complaint. (One later formula, the one that counts terms, will need d=0, and the reason is
worth seeing when you get there.)
1,2,4,8,… is not arithmetic. Its differences are 1, then 2, then 4, and they
never settle down.
1,4,9,16,… (the squares) is not arithmetic either. Its differences are 3, then 5,
then 7. They change by a constant amount, which is interesting, but they are not constant.
To test a sequence, subtract each term from the one after it and compare all the results. Two
matching differences prove nothing: 2,5,8,13 starts with 3 and 3 and then jumps by 5.
The nth term, by counting steps
You know a1 and you know d. How do you reach a50 without writing down forty-nine additions?
Every move to the next term costs one d. So the question is not “how many terms are there” but
“how many steps do I take”, and those are two different counts.
Five terms, but only four steps between them. Each step adds d, so getting from the 1st term to the 5th costs four lots of d, not five. That is where the n minus 1 in the formula comes from.
Five terms sit on that line, and four arrows join them. The terms are the places; d is the toll you
pay to move between places. Nobody pays a toll to arrive at the place they are already standing on,
so the first term costs nothing. Because that first place is free, the count of tolls is one less than
the count of places.
Take any n≥2 (the case n=1 just says a1=a1 and needs no argument).
The definition hands you one equation per step. Stepping from term 1 to term 2 gives
a2−a1=d, stepping from term 2 to term 3 gives a3−a2=d, and so on. The steps run
from 1 to 2, from 2 to 3, all the way up to the step from n−1 to n. So there are exactly
n−1 of them, one for each starting index between 1 and n−1.
Add all n−1 of those equations together. Every right side is d, so the right sides total
(n−1)d:
k=1∑n−1(ak+1−ak)=k=1∑n−1d=(n−1)d.
The left side collapses. Written out, it is
(a2−a1)+(a3−a2)+(a4−a3)+⋯+(an−an−1), and every interior term appears
twice, once with a plus sign and once with a minus sign. Those pairs annihilate each other and only
the two ends survive, so the left side is an−a1. Therefore
an−a1=(n−1)d,soan=a1+(n−1)d.
The whole content of the formula is that count n−1. It is the number of steps, and the number of
steps between n terms is always one fewer than n. Fence posts show the same pattern: five posts
have four gaps between them.
∎
Two rearrangements of that formula earn their keep. Solving for d gives
d=n−1an−a1,
and the same argument run between any two terms (there are m−k steps from term k to term m)
gives the more flexible version
am=ak+(m−k)d,sod=m−kam−ak.
Both denominators count steps, never terms. From a3 to a11 there are 8 steps, so you divide
by 8, not by 11 and not by 9.
The fence-post count is the kind of thing that stays slippery until you have done it with your hands, so
the figure below hands you one step at a time. You set the number the step starts from and the number
added to it, and the arrow shows that single step and where it lands.
Set the start to −4 and the number added to 2. The arrow lands on −2, so a sequence with
a1=−4 and d=2 has a2=−2. Move the start to −2, where you just landed, and take the same
step again to reach 0, which is a3. Carry on from 0 and then from 2. You end on 4, and 4 is
a5. Now count what you did: five terms named, four steps taken, which is the fence-post rule above
with the posts in your hands. That gap of one is the whole of n−1, and it is not a convention anyone
chose. The first term is where you begin, so it costs nothing, and only the terms after it have to be
walked to. Set the number added to −2 and run the route backwards from 4 to confirm it from the
other side. You take four steps again, and land back on −4, because a negative common difference
changes the direction of the walk and nothing at all about the counting.
Number line walk
Start at-4Then add+2
-4 + 2 = -2.
Adding a positive number moves 2 units to the right.
A single step along a number line, sized and positioned by you. Because the step can be retaken from the point the last one reached, an arithmetic sequence can be walked out term by term and its steps counted against the terms they produce.
An arithmetic sequence is a linear function of n
Expand the formula and something familiar appears:
an=a1+(n−1)d=dn+(a1−d).
The right side is dn+b with b=a1−d, so an is a linear function of n with slope d.
The converse is true as well. If a sequence obeys an=mn+b for every n, then
an+1−an=(m(n+1)+b)−(mn+b)=m,
a constant, so the sequence is arithmetic with d=m. Both directions hold, so “arithmetic” and
“linear in n” are two names for the same family of sequences. That is a genuinely useful equivalence:
whenever you meet a rule like ak=4k+1, you may read off d=4 on sight, with no subtraction at
all.
It also tells you what these sequences look like. Plot the points (n,an) and they land on a
straight line of slope d, evenly spaced, one point per positive integer. The intercept a1−d is
the “zeroth term”, the value the line would take at n=0, a term the sequence itself never has.
How many terms are there
Turn the formula around once more. If a sequence starts at a1, steps by d, and its last term is
L, then L=a1+(n−1)d, so
n=dL−a1+1.
The division tells you how many steps separate the first term from the last, and then the +1
converts steps back into terms. It is the fence-post count again, run backwards, and the missing +1
is one of the most common errors in this entire topic.
This is the one formula in the lesson that demands d=0, since it divides by d. The
restriction is not a flaw in the formula but a fact about the question: if d=0 then every term
equals L. In that case 3,3,3 and 3,3,3,3,3 look identical from their values alone, so no
rule could recover the count from them. The nth-term and sum formulas never divide by d, so they
stay valid even in that degenerate case.
Worked example 1Find the 30th term of 4,11,18,25,…
The differences are 11−4=7, 18−11=7, and 25−18=7, so the sequence is arithmetic with
a1=4 and d=7.
Getting from the 1st term to the 30th takes 29 steps, not 30:
a30=a1+(30−1)d=4+29⋅7=4+203=207.
Had you multiplied by 30 instead, you would have got 4+210=214, which is the 31st term. The
formula never says “multiply d by the term number”; it says “multiply d by the number of steps”.
Worked example 2An arithmetic sequence has a6=23 and a14=55. Find a1 and a formula for an.
From term 6 to term 14 is 14−6=8 steps, and those steps carry the value from 23 up to 55,
a rise of 32. Each step is worth the same amount, so
d=14−6a14−a6=855−23=832=4.
Now walk backwards from a6 to a1, which is 5 steps down:
a1=a6−5d=23−5⋅4=3.
That gives the explicit rule, which you can simplify:
an=3+(n−1)4=4n−1.
Check it against the data you were given: a6=24−1=23 and a14=56−1=55. Both match.
Notice the check is worth doing, because dividing by 9 (the number of terms from the 6th to the 14th)
instead of 8 would have produced d=932. With that value of d, nothing would have come
out whole.
Check your understanding
An arithmetic sequence has a1=6 and d=4. What is a12?
Reaching the 12th term from the 1st takes 11 steps, not 12.
a12=6+(12−1)⋅4=6+44=50
The tempting answer 54 comes from multiplying d by 12, and that is the 13th term.
Worked example 3How many terms are in 8,15,22,…,148?
The common difference is d=7, and the last term is L=148.
First count the steps from the first term to the last. Each step adds 7, and the total climb is
148−8=140, so
dL−a1=7148−8=7140=20 steps.
Twenty steps land you on the last term, but you were standing on a term before you took any step at
all. So the number of terms is
n=20+1=21.
Confirm it forwards: a21=8+20⋅7=148, exactly the last term.
Adding the terms, by writing the sum twice
A series is what you get when you add up the terms of a sequence. Write Sn for the sum of the
first n terms, which in the sigma notation from the last lesson is
Sn=k=1∑nak=a1+a2+⋯+an.
Adding a hundred terms one at a time is hopeless, and the trick that rescues you is one of the most
famous in mathematics. Write the sum out forwards. Then, underneath it, write the very same sum
backwards:
Now add the two lines column by column. The first column gives a1+an. The second gives
(a1+d)+(an−d), and the d‘s cancel, so it is a1+an again. The third gives
(a1+2d)+(an−2d)=a1+an. Every column produces the same total, and the reason is easiest
to see by walking along the two lines. As you walk right along the top line you gain d at each step,
while the bottom line loses d at each step, and the two motions cancel exactly.
Let the sequence be arithmetic with common difference d. The kth column of the layout above pairs
the kth term counted from the front with the kth term counted from the back. In symbols, that
column pairs ak with an+1−k, since counting back k−1 steps from an lands on index
n+1−k. Use the formula for the nth term on both:
The k has vanished, because (k−1)+(n−k)=n−1 no matter what k is. So every column has the
same total, and since an=a1+(n−1)d, that common total is exactly
2a1+(n−1)d=a1+an.
There are n columns, one for each term, so adding the two copies of the sum gives
2Sn=n(a1+an),henceSn=2n(a1+an).
The doubling is what makes the argument airtight. Suppose a student instead tries to fold the sum in
half and pair the terms off physically, first with last, second with second-last. That student
immediately has to ask whether n is even (so the pairs come out whole) or odd (so one lonely middle
term is stranded). Writing a second, reversed copy of the whole sum never asks that question: every one of
the n terms gets a partner, whether n is 100 or 101. When n is odd the middle term is
simply paired with itself, and that is not a special case at all. That is because
am+am=a1+an holds for the middle index m, just as the column identity above says it
must. No case split, no leftovers.
∎
The doubling trick in pictures, for 2 + 5 + 8 + 11 + 14. The dark bars are the sum written forwards; the accented bars stacked on top are the same sum written backwards. Every column now stands 16 units tall, the first term plus the last, and there are 5 columns, so twice the sum is 5 times 16, which is 80. The sum itself is 40.
The same formula, wearing different clothes
The formula Sn=2n(a1+an) wants the last term. Often you know d instead, and
substituting an=a1+(n−1)d turns it into
Sn=2n(a1+a1+(n−1)d)=2n(2a1+(n−1)d).
These are not two formulas to memorize. They are one statement written with different inputs: use the
first when the last term is handed to you, the second when only a1 and d are. Both come from the
single fact 2Sn=n(a1+an).
Read 2n(a1+an) once more as n⋅2a1+an, and the sum tells you
something you can feel. An arithmetic series is just its number of terms times the average of its
first and last term. The terms are evenly spread, so the small ones at one end compensate exactly for
the large ones at the other. When n is odd the middle term is that average, since the middle index
is m=2n+1 and
am=a1+2n−1d=2a1+an,
so a sum of 9 terms is 9 times its 5th term, and a sum of 11 terms is 11 times its 6th. That
shortcut works only because the sequence is arithmetic. It is not a fact about sums in general.
One last observation, which the quadratics chapter has already prepared you for. Expanding the second
form gives
Sn=2dn2+(a1−2d)n,
a quadratic in n with no constant term.
The converse holds too, and it costs one line, so do not take it on trust. Suppose all you are told is
that some sequence has running total Sn=An2+Bn for every n. Recover its nth term as the
jump the total makes when that term arrives:
That is linear in n, and a sequence linear in n is arithmetic, by the equivalence proved earlier.
So the sequence is arithmetic with d=2A, whatever A and B are. If a problem hands you
Sn=2n2+3n, you may read off d=4 and an=4n+1 without ever seeing a single term of the
sequence.
Worked example 4Add the whole numbers from 1 to 100
The sequence 1,2,3,…,100 is arithmetic with a1=1, d=1, and a100=100, so
there is nothing to compute before applying the sum.
S100=2100(1+100)=50⋅101=5050.
The doubling argument is even easier to see here: written forwards and backwards, the columns are
1+100, 2+99, 3+98, and so on, one hundred columns each totalling 101, giving
2S=100⋅101=10100.
Worked example 5Evaluate ∑k=120(3k−2)
The rule ak=3k−2 is linear in k, so by the equivalence proved above the terms form an
arithmetic sequence with d=3. You need only its two ends:
a1=3(1)−2=1,a20=3(20)−2=58.
There are 20 terms, so apply the sum directly:
S20=220(1+58)=10⋅59=590.
The second form is a useful check, since it never mentions a20:
S20=220(2(1)+19⋅3)=10(2+57)=590.✓
Check your understanding
An arithmetic sequence has a1=3 and a20=60. What is S20, the sum of its first 20 terms?
You know both ends and the number of terms, so use the first form of the sum.
S20=220(3+60)=10⋅63=630
The answer 1,260 is what the doubling produces, 2S20=20(3+60), so halving it is not optional.
Worked example 6A stadium section has 24 seats in the first row and 4 more in each row after it. How many seats are in the first 15 rows?
Row by row the seat counts are 24,28,32,…, an arithmetic sequence with a1=24 and
d=4. The total you want is S15.
Take the route through the last row first. Reaching row 15 from row 1 takes 14 steps:
a15=24+14⋅4=80 seats in row 15.
Now sum the fifteen rows:
S15=215(24+80)=215⋅104=15⋅52=780.
The second form skips the intermediate step and must agree:
S15=215(2⋅24+14⋅4)=215(48+56)=215⋅104=780.✓
The section holds 780 seats. Sanity-check the size: fifteen rows averaging 52 seats is about 780,
and 52 is indeed the average of the first row (24) and the last (80).
Check your understanding
How many terms are in the sequence 7,12,17,…,97?
The common difference is d=5, and the climb from the first term to the last is 97−7=90, so the number of steps is 90÷5=18.
n=597−7+1=18+1=19
Steps are not terms. Eighteen steps land on the last of 19 terms, because you were already standing on the first before you took a single step.
Common mistakes
Practice
Multiple Choice Questions (MCQ)
Progressively harder sets of questions. Each opens on its own page.
Longer questions in parts, to be worked out on paper. Progressive hints, the answer on its
own so you can check yourself and try again, then the full worked solution, plus a rubric
to mark your own work against.
Adding a run of evenly spaced numbers is the easy direction. Reversing it is not. Suppose you are
handed the total, the first term and the step, and asked how many terms produced that total. The
question is much harder, and its answer is fifteen centuries old.
It sits in the Aryabhatiya, a compact book of astronomy composed in verse in the year 499. Its author
was Aryabhata, an astronomer working in India. One of his rules adds a progression, which was well
known even then. The rule directly after it runs the other way, getting the number of terms back from
the total, and that one is a real find.
Consider what such a rule must contain. A total that climbs by a fixed step is quadratic in the number
of terms. That is exactly the shape you derived for Sn above. So getting the count back means
solving a quadratic. Sure enough, the rule carries a square root inside it, stated in verse, centuries
before anyone wrote a quadratic formula down.
The forward direction is older still, and it began as a picture. The Pythagoreans, a school of scholars
in ancient Greece, arranged pebbles into triangles and studied 1+2+3+⋯ as a shape rather
than a sum.
Both directions belong to the single identity you proved by writing the series above its own reversal.