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 dd throughout
  • Apply an=a1+(n1)da_n = a_1 + (n-1)d, counting steps not terms
  • Recover dd from two terms by dividing rise by steps
  • Count terms with n=La1d+1n = \tfrac{L - a_1}{d} + 1
  • Prove Sn=n2(a1+an)S_n = \tfrac{n}{2}(a_1 + a_n) by reversing and adding
  • Read a quadratic SnS_n backwards to recover dd

What makes a sequence arithmetic

A sequence is a function on the positive integers, so ana_n is the output at input nn. 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,a_1, a_2, a_3, \ldots is arithmetic when there is a fixed number dd, the common difference, with

an+1an=dfor every n1,a_{n+1} - a_n = d \qquad \text{for every } n \ge 1,

which is the same as the recursive rule an+1=an+da_{n+1} = a_n + 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:

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,132, 5, 8, 13 starts with 33 and 33 and then jumps by 55.

The nth term, by counting steps

You know a1a_1 and you know dd. How do you reach a50a_{50} without writing down forty-nine additions?

Every move to the next term costs one dd. So the question is not “how many terms are there” but “how many steps do I take”, and those are two different counts.

Terms versus steps in an arithmetic sequenceFive equally spaced points on a line hold the terms a1 to a5. Four arrows, each labeled plus d, join neighbouring points. A bracket below the line spans all five points and reports four steps.+d+d+d+da1a2a3a4a51st term to 5th term: 4 steps, so 4 lots of d
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; dd 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.

The nth term is an=a1+(n1)da_n = a_1 + (n-1)d#

Take any n2n \ge 2 (the case n=1n = 1 just says a1=a1a_1 = a_1 and needs no argument).

The definition hands you one equation per step. Stepping from term 11 to term 22 gives a2a1=da_2 - a_1 = d, stepping from term 22 to term 33 gives a3a2=da_3 - a_2 = d, and so on. The steps run from 11 to 22, from 22 to 33, all the way up to the step from n1n-1 to nn. So there are exactly n1n - 1 of them, one for each starting index between 11 and n1n-1.

Add all n1n - 1 of those equations together. Every right side is dd, so the right sides total (n1)d(n-1)d:

k=1n1(ak+1ak)=k=1n1d=(n1)d.\sum_{k=1}^{n-1} \big(a_{k+1} - a_k\big) = \sum_{k=1}^{n-1} d = (n-1)d.

The left side collapses. Written out, it is (a2a1)+(a3a2)+(a4a3)++(anan1)(a_2 - a_1) + (a_3 - a_2) + (a_4 - a_3) + \cdots + (a_n - a_{n-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 ana1a_n - a_1. Therefore

ana1=(n1)d,soan=a1+(n1)d.a_n - a_1 = (n-1)d, \qquad \text{so} \qquad a_n = a_1 + (n-1)d.

The whole content of the formula is that count n1n - 1. It is the number of steps, and the number of steps between nn terms is always one fewer than nn. Fence posts show the same pattern: five posts have four gaps between them.

Two rearrangements of that formula earn their keep. Solving for dd gives

d=ana1n1,d = \frac{a_n - a_1}{n - 1},

and the same argument run between any two terms (there are mkm - k steps from term kk to term mm) gives the more flexible version

am=ak+(mk)d,sod=amakmk.a_m = a_k + (m - k)d, \qquad \text{so} \qquad d = \frac{a_m - a_k}{m - k}.

Both denominators count steps, never terms. From a3a_3 to a11a_{11} there are 88 steps, so you divide by 88, not by 1111 and not by 99.

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-4 and the number added to 22. The arrow lands on 2-2, so a sequence with a1=4a_1 = -4 and d=2d = 2 has a2=2a_2 = -2. Move the start to 2-2, where you just landed, and take the same step again to reach 00, which is a3a_3. Carry on from 00 and then from 22. You end on 44, and 44 is a5a_5. 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 n1n - 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-2 and run the route backwards from 44 to confirm it from the other side. You take four steps again, and land back on 4-4, because a negative common difference changes the direction of the walk and nothing at all about the counting.

Number line walk

-4 + 2 = -2. Adding a positive number moves 2 units to the right. A number line from -6 to 6. A dot marks the starting number and an arrow shows the step to the landing point. Use the controls below the figure to change either one. -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 +2 -4 -2
Start at Then add

-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+(n1)d=dn+(a1d).a_n = a_1 + (n-1)d = dn + (a_1 - d).

The right side is dn+bdn + b with b=a1db = a_1 - d, so ana_n is a linear function of nn with slope dd. The converse is true as well. If a sequence obeys an=mn+ba_n = mn + b for every nn, then

an+1an=(m(n+1)+b)(mn+b)=m,a_{n+1} - a_n = \big(m(n+1) + b\big) - \big(mn + b\big) = m,

a constant, so the sequence is arithmetic with d=md = m. Both directions hold, so “arithmetic” and “linear in nn” are two names for the same family of sequences. That is a genuinely useful equivalence: whenever you meet a rule like ak=4k+1a_k = 4k + 1, you may read off d=4d = 4 on sight, with no subtraction at all.

It also tells you what these sequences look like. Plot the points (n,an)(n, a_n) and they land on a straight line of slope dd, evenly spaced, one point per positive integer. The intercept a1da_1 - d is the “zeroth term”, the value the line would take at n=0n = 0, a term the sequence itself never has.

How many terms are there

Turn the formula around once more. If a sequence starts at a1a_1, steps by dd, and its last term is LL, then L=a1+(n1)dL = a_1 + (n-1)d, so

n=La1d+1.n = \frac{L - a_1}{d} + 1.

The division tells you how many steps separate the first term from the last, and then the +1+1 converts steps back into terms. It is the fence-post count again, run backwards, and the missing +1+1 is one of the most common errors in this entire topic.

This is the one formula in the lesson that demands d0d \neq 0, since it divides by dd. The restriction is not a flaw in the formula but a fact about the question: if d=0d = 0 then every term equals LL. In that case 3,3,33, 3, 3 and 3,3,3,3,33, 3, 3, 3, 3 look identical from their values alone, so no rule could recover the count from them. The nnth-term and sum formulas never divide by dd, so they stay valid even in that degenerate case.

Worked example 1 Find the 30th term of 4,11,18,25,4, 11, 18, 25, \ldots

The differences are 114=711 - 4 = 7, 1811=718 - 11 = 7, and 2518=725 - 18 = 7, so the sequence is arithmetic with a1=4a_1 = 4 and d=7d = 7.

Getting from the 1st term to the 30th takes 2929 steps, not 3030:

a30=a1+(301)d=4+297=4+203=207.a_{30} = a_1 + (30 - 1)d = 4 + 29 \cdot 7 = 4 + 203 = 207.

Had you multiplied by 3030 instead, you would have got 4+210=2144 + 210 = 214, which is the 31st term. The formula never says “multiply dd by the term number”; it says “multiply dd by the number of steps”.

Worked example 2 An arithmetic sequence has a6=23a_6 = 23 and a14=55a_{14} = 55. Find a1a_1 and a formula for ana_n.

From term 66 to term 1414 is 146=814 - 6 = 8 steps, and those steps carry the value from 2323 up to 5555, a rise of 3232. Each step is worth the same amount, so

d=a14a6146=55238=328=4.d = \frac{a_{14} - a_6}{14 - 6} = \frac{55 - 23}{8} = \frac{32}{8} = 4.

Now walk backwards from a6a_6 to a1a_1, which is 55 steps down:

a1=a65d=2354=3.a_1 = a_6 - 5d = 23 - 5 \cdot 4 = 3.

That gives the explicit rule, which you can simplify:

an=3+(n1)4=4n1.a_n = 3 + (n-1)4 = 4n - 1.

Check it against the data you were given: a6=241=23a_6 = 24 - 1 = 23 and a14=561=55a_{14} = 56 - 1 = 55. Both match. Notice the check is worth doing, because dividing by 99 (the number of terms from the 6th to the 14th) instead of 88 would have produced d=329d = \tfrac{32}{9}. With that value of dd, nothing would have come out whole.

Check your understanding

An arithmetic sequence has a1=6a_1 = 6 and d=4d = 4. What is a12a_{12}?

Answer choices

Worked example 3 How many terms are in 8,15,22,,1488, 15, 22, \ldots, 148?

The common difference is d=7d = 7, and the last term is L=148L = 148.

First count the steps from the first term to the last. Each step adds 77, and the total climb is 1488=140148 - 8 = 140, so

La1d=14887=1407=20 steps.\frac{L - a_1}{d} = \frac{148 - 8}{7} = \frac{140}{7} = 20 \text{ 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.n = 20 + 1 = 21.

Confirm it forwards: a21=8+207=148a_{21} = 8 + 20 \cdot 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 SnS_n for the sum of the first nn terms, which in the sigma notation from the last lesson is

Sn=k=1nak=a1+a2++an.S_n = \sum_{k=1}^{n} a_k = a_1 + a_2 + \cdots + a_n.

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:

Sn=a1+(a1+d)+(a1+2d)++an,Sn=an+(and)+(an2d)++a1.\begin{aligned} S_n &= a_1 + (a_1 + d) + (a_1 + 2d) + \cdots + a_n, \\ S_n &= a_n + (a_n - d) + (a_n - 2d) + \cdots + a_1. \end{aligned}

Now add the two lines column by column. The first column gives a1+ana_1 + a_n. The second gives (a1+d)+(and)(a_1 + d) + (a_n - d), and the dd‘s cancel, so it is a1+ana_1 + a_n again. The third gives (a1+2d)+(an2d)=a1+an(a_1 + 2d) + (a_n - 2d) = a_1 + a_n. 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 dd at each step, while the bottom line loses dd at each step, and the two motions cancel exactly.

The sum of the first n terms is Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n)#

Let the sequence be arithmetic with common difference dd. The kkth column of the layout above pairs the kkth term counted from the front with the kkth term counted from the back. In symbols, that column pairs aka_k with an+1ka_{n+1-k}, since counting back k1k - 1 steps from ana_n lands on index n+1kn+1-k. Use the formula for the nnth term on both:

ak+an+1k=(a1+(k1)d)+(a1+(nk)d)=2a1+(n1)d.a_k + a_{n+1-k} = \big(a_1 + (k-1)d\big) + \big(a_1 + (n-k)d\big) = 2a_1 + (n-1)d.

The kk has vanished, because (k1)+(nk)=n1(k-1) + (n-k) = n-1 no matter what kk is. So every column has the same total, and since an=a1+(n1)da_n = a_1 + (n-1)d, that common total is exactly

2a1+(n1)d=a1+an.2a_1 + (n-1)d = a_1 + a_n.

There are nn columns, one for each term, so adding the two copies of the sum gives

2Sn=n(a1+an),henceSn=n2(a1+an).2S_n = n(a_1 + a_n), \qquad \text{hence} \qquad S_n = \frac{n}{2}\,(a_1 + a_n).

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 nn 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 nn terms gets a partner, whether nn is 100100 or 101101. When nn 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+ana_m + a_m = a_1 + a_n holds for the middle index mm, just as the column identity above says it must. No case split, no leftovers.

Writing an arithmetic sum forwards and backwardsFive columns. Each column stacks a term of the sequence 2, 5, 8, 11, 14 under the corresponding term of the reversed sequence 14, 11, 8, 5, 2, so all five columns reach the same total height of 16.14118522581114every columntotals 16
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=n2(a1+an)S_n = \tfrac{n}{2}(a_1 + a_n) wants the last term. Often you know dd instead, and substituting an=a1+(n1)da_n = a_1 + (n-1)d turns it into

Sn=n2(a1+a1+(n1)d)=n2(2a1+(n1)d).S_n = \frac{n}{2}\Big(a_1 + a_1 + (n-1)d\Big) = \frac{n}{2}\big(2a_1 + (n-1)d\big).

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 a1a_1 and dd are. Both come from the single fact 2Sn=n(a1+an)2S_n = n(a_1 + a_n).

Read n2(a1+an)\tfrac{n}{2}(a_1 + a_n) once more as na1+an2n \cdot \tfrac{a_1 + a_n}{2}, 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 nn is odd the middle term is that average, since the middle index is m=n+12m = \tfrac{n+1}{2} and

am=a1+n12d=a1+an2,a_m = a_1 + \frac{n-1}{2}\,d = \frac{a_1 + a_n}{2},

so a sum of 99 terms is 99 times its 5th term, and a sum of 1111 terms is 1111 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=d2n2+(a1d2)n,S_n = \frac{d}{2}n^2 + \Big(a_1 - \frac{d}{2}\Big)n,

a quadratic in nn 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+BnS_n = An^2 + Bn for every nn. Recover its nnth term as the jump the total makes when that term arrives:

an=SnSn1=(An2+Bn)(A(n1)2+B(n1))=2An+(BA).a_n = S_n - S_{n-1} = \big(An^2 + Bn\big) - \big(A(n-1)^2 + B(n-1)\big) = 2An + (B - A).

That is linear in nn, and a sequence linear in nn is arithmetic, by the equivalence proved earlier. So the sequence is arithmetic with d=2Ad = 2A, whatever AA and BB are. If a problem hands you Sn=2n2+3nS_n = 2n^2 + 3n, you may read off d=4d = 4 and an=4n+1a_n = 4n + 1 without ever seeing a single term of the sequence.

Worked example 4 Add the whole numbers from 11 to 100100

The sequence 1,2,3,,1001, 2, 3, \ldots, 100 is arithmetic with a1=1a_1 = 1, d=1d = 1, and a100=100a_{100} = 100, so there is nothing to compute before applying the sum.

S100=1002(1+100)=50101=5050.S_{100} = \frac{100}{2}\,(1 + 100) = 50 \cdot 101 = 5050.

The doubling argument is even easier to see here: written forwards and backwards, the columns are 1+1001 + 100, 2+992 + 99, 3+983 + 98, and so on, one hundred columns each totalling 101101, giving 2S=100101=101002S = 100 \cdot 101 = 10100.

Worked example 5 Evaluate k=120(3k2)\sum_{k=1}^{20} (3k - 2)

The rule ak=3k2a_k = 3k - 2 is linear in kk, so by the equivalence proved above the terms form an arithmetic sequence with d=3d = 3. You need only its two ends:

a1=3(1)2=1,a20=3(20)2=58.a_1 = 3(1) - 2 = 1, \qquad a_{20} = 3(20) - 2 = 58.

There are 2020 terms, so apply the sum directly:

S20=202(1+58)=1059=590.S_{20} = \frac{20}{2}\,(1 + 58) = 10 \cdot 59 = 590.

The second form is a useful check, since it never mentions a20a_{20}:

S20=202(2(1)+193)=10(2+57)=590.S_{20} = \frac{20}{2}\big(2(1) + 19 \cdot 3\big) = 10(2 + 57) = 590. \checkmark

Check your understanding

An arithmetic sequence has a1=3a_1 = 3 and a20=60a_{20} = 60. What is S20S_{20}, the sum of its first 2020 terms?

Answer choices

Worked example 6 A stadium section has 2424 seats in the first row and 44 more in each row after it. How many seats are in the first 1515 rows?

Row by row the seat counts are 24,28,32,24, 28, 32, \ldots, an arithmetic sequence with a1=24a_1 = 24 and d=4d = 4. The total you want is S15S_{15}.

Take the route through the last row first. Reaching row 1515 from row 11 takes 1414 steps:

a15=24+144=80 seats in row 15.a_{15} = 24 + 14 \cdot 4 = 80 \text{ seats in row } 15.

Now sum the fifteen rows:

S15=152(24+80)=152104=1552=780.S_{15} = \frac{15}{2}\,(24 + 80) = \frac{15}{2} \cdot 104 = 15 \cdot 52 = 780.

The second form skips the intermediate step and must agree:

S15=152(224+144)=152(48+56)=152104=780.S_{15} = \frac{15}{2}\big(2 \cdot 24 + 14 \cdot 4\big) = \frac{15}{2}(48 + 56) = \frac{15}{2} \cdot 104 = 780. \checkmark

The section holds 780780 seats. Sanity-check the size: fifteen rows averaging 5252 seats is about 780780, and 5252 is indeed the average of the first row (2424) and the last (8080).

Check your understanding

How many terms are in the sequence 7,12,17,,977, 12, 17, \ldots, 97?

Answer choices

Common mistakes

Practice

Multiple Choice Questions (MCQ)

Progressively harder sets of questions. Each opens on its own page.

Free Response Questions (FRQ)

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.

Free response Work it out on paper 5 questions Start →
More practice (optional)

Extra sets, as hard as the Challenge set. Each one opens on its own page.

More resources (optional)

Other explanations of this lesson, if you want a second take.

A bit of history (Optional)

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 SnS_n 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+1 + 2 + 3 + \cdots as a shape rather than a sum.

Both directions belong to the single identity you proved by writing the series above its own reversal.