STEMviz
Mathematics · Algebra, Number Theory and Sequences

Arithmetic Sequences - Properties and Applications

Derive and apply the general term and sum formulas for arithmetic sequences, including the arithmetic mean and real-world modelling.

Arithmetic Sequences - Properties and Applications

A sequence is simply an ordered, numbered list of terms, u1,u2,u3,…u_1, u_2, u_3, \ldots — a function whose domain is the positive integers rather than the reals. The simplest, most common pattern a sequence can follow is that each term is obtained from the one before it by adding a fixed amount: 5,8,11,14,17,…5, 8, 11, 14, 17, \ldots. This chapter studies exactly that pattern, the arithmetic sequence, builds the formula for its general term and the sum of its terms, and applies both to realistic problems. The tools developed here — a recursive description versus an explicit formula, and the derivation of a sum formula by a clever pairing trick — reappear with only minor changes when geometric sequences are studied in the next chapter.

Have to hand: comfort with solving simultaneous linear equations, since many applied problems give two pieces of information about a sequence and ask you to recover its defining constants.

1. Defining an Arithmetic Sequence

An arithmetic sequence is a sequence in which the difference between any term and the one immediately before it is constant. This constant is called the common difference, denoted dd:

un+1−un=dfor every n≥1u_{n+1} - u_n = d \qquad \text{for every } n \geq 1

Equivalently, an arithmetic sequence can be defined recursively: u1u_1 is given, and un+1=un+du_{n+1} = u_n + d for n≥1n \geq 1. A recursive definition is easy to state but inconvenient to use directly — finding u50u_{50} from a recursive definition requires computing all 49 preceding terms.

Recursive versus explicit. A recursive formula defines each term from the previous one(s); an explicit (or closed) formula gives unu_n directly from nn, with no reference to other terms. Converting from recursive to explicit is one of the central tasks of this chapter.

2. The General Term Formula

Starting from u1u_1 and adding dd repeatedly:

u1,u2=u1+d,u3=u1+2d,u4=u1+3d,…u_1,\quad u_2 = u_1+d,\quad u_3 = u_1+2d,\quad u_4 = u_1+3d,\quad \ldots

the pattern is that unu_n is reached from u1u_1 by adding dd exactly n−1n-1 times (not nn times — a frequent source of off-by-one errors):

un=u1+(n−1)d\boxed{u_n = u_1 + (n-1)d}

This can be proved rigorously by induction (Chapter 3): the base case n=1n=1 gives u1=u1+0=u1u_1 = u_1 + 0 = u_1, true; the inductive step assumes uk=u1+(k−1)du_k = u_1+(k-1)d and uses the recursive definition uk+1=uk+du_{k+1}=u_k+d to get uk+1=u1+(k−1)d+d=u1+kd=u1+((k+1)−1)du_{k+1} = u_1+(k-1)d+d = u_1+kd = u_1+((k+1)-1)d, matching the formula at n=k+1n=k+1.

Worked example. An arithmetic sequence has first term u1=7u_1 = 7 and common difference d=−3d=-3. Find u20u_{20}.

u20=u1+(20−1)d=7+19(−3)=7−57=−50u_{20} = u_1 + (20-1)d = 7 + 19(-3) = 7 - 57 = -50

Worked example — finding u1u_1 and dd from two terms. In an arithmetic sequence, u5=23u_5 = 23 and u12=58u_{12} = 58. Find u1u_1, dd, and u30u_{30}.

Using the general term formula for each given term:

u5=u1+4d=23u12=u1+11d=58u_5 = u_1 + 4d = 23 \qquad\qquad u_{12} = u_1 + 11d = 58

Subtracting the first equation from the second eliminates u1u_1:

(u1+11d)−(u1+4d)=58−23⟹7d=35⟹d=5(u_1+11d) - (u_1+4d) = 58-23 \quad\Longrightarrow\quad 7d = 35 \quad\Longrightarrow\quad d=5

Substituting back: u1+4(5)=23⇒u1=3u_1 + 4(5) = 23 \Rightarrow u_1 = 3. Then u30=3+29(5)=3+145=148u_{30} = 3 + 29(5) = 3+145=148.

The subtraction trick. Whenever two terms umu_m and unu_n of an arithmetic sequence are known, subtracting their general-term equations eliminates u1u_1 immediately, leaving d=un−umn−md = \dfrac{u_n-u_m}{n-m} — faster than solving the full simultaneous system from scratch.

3. The Arithmetic Mean

If aa, xx, bb are three consecutive terms of an arithmetic sequence, then x−a=b−xx-a = b-x (the common difference is the same on both sides of xx), so

x=a+b2x = \frac{a+b}{2}

The middle term xx is called the arithmetic mean of aa and bb — literally their average. More generally, to insert kk arithmetic means between two numbers aa and bb (creating an arithmetic sequence of k+2k+2 terms with aa first and bb last), treat aa as u1u_1 and bb as uk+2u_{k+2}, and solve b=a+(k+1)db = a + (k+1)d for the common difference d=b−ak+1d = \dfrac{b-a}{k+1}.

Worked example. Insert three arithmetic means between 55 and 2525. Here a=5a=5, b=25=u5b=25=u_5 (three means plus the two endpoints make five terms), so d=25−54=5d = \dfrac{25-5}{4} = 5. The sequence is 5,10,15,20,255, 10, 15, 20, 25.

4. The Sum of an Arithmetic Series

A series is the sum of the terms of a sequence. Denote the sum of the first nn terms of an arithmetic sequence by SnS_n. Writing the sum forwards and backwards and adding the two (a method attributed to the young Gauss):

Sn=u1+(u1+d)+(u1+2d)+⋯+unS_n = u_1 + (u_1+d) + (u_1+2d) + \cdots + u_n Sn=un+(un−d)+(un−2d)+⋯+u1S_n = u_n + (u_n-d) + (u_n-2d) + \cdots + u_1

Adding these two equations term by term, each column sums to u1+unu_1+u_n (since whatever is added to u1u_1 in the top row is subtracted from unu_n in the bottom row), and there are nn columns:

2Sn=n(u1+un)⟹Sn=n2(u1+un)2S_n = n(u_1+u_n) \quad\Longrightarrow\quad \boxed{S_n = \frac{n}{2}(u_1+u_n)}

Substituting un=u1+(n−1)du_n = u_1+(n-1)d gives the equivalent form in terms of u1u_1 and dd alone, useful when unu_n is not already known:

Sn=n2(2u1+(n−1)d)S_n = \frac{n}{2}\big(2u_1+(n-1)d\big)

Worked example. Find the sum of the first 3030 terms of the arithmetic sequence with u1=4u_1=4, d=6d=6.

S30=302(2(4)+(30−1)(6))=15(8+174)=15(182)=2730S_{30} = \frac{30}{2}\big(2(4)+(30-1)(6)\big) = 15\big(8+174\big) = 15(182) = 2730

Worked example — a classic Gauss-style sum. Find 7+14+21+⋯+7007 + 14 + 21 + \cdots + 700 (the sum of the first however-many multiples of 77 up to 700700). First identify nn: this is an arithmetic sequence with u1=7u_1=7, d=7d=7, un=700u_n=700, so

700=7+(n−1)7⟹693=7(n−1)⟹n−1=99⟹n=100700 = 7+(n-1)7 \quad\Longrightarrow\quad 693 = 7(n-1) \quad\Longrightarrow\quad n-1=99 \quad\Longrightarrow\quad n=100

Then S100=1002(7+700)=50(707)=35 350S_{100} = \dfrac{100}{2}(7+700) = 50(707) = 35\,350.

5. Recovering a Term from SnS_n and Sn−1S_{n-1}

Since Sn=u1+u2+⋯+unS_n = u_1+u_2+\cdots+u_n and Sn−1=u1+⋯+un−1S_{n-1}=u_1+\cdots+u_{n-1}, subtracting recovers the individual term:

un=Sn−Sn−1(n≥2),u1=S1u_n = S_n - S_{n-1} \qquad (n\geq2), \qquad u_1 = S_1

This relation holds for any sequence, not only arithmetic ones, and is useful whenever a problem gives a formula for SnS_n directly (rather than for unu_n) and asks for individual terms.

Worked example. A sequence has Sn=3n2+2nS_n = 3n^2+2n. Find u1u_1 and u5u_5, and determine whether the sequence is arithmetic.

u1=S1=3(1)2+2(1)=5u_1 = S_1 = 3(1)^2+2(1)=5. For n≥2n\geq2: un=Sn−Sn−1=(3n2+2n)−(3(n−1)2+2(n−1))u_n = S_n-S_{n-1} = \big(3n^2+2n\big)-\big(3(n-1)^2+2(n-1)\big). Expanding 3(n−1)2+2(n−1)=3n2−6n+3+2n−2=3n2−4n+13(n-1)^2+2(n-1) = 3n^2-6n+3+2n-2=3n^2-4n+1, so

un=(3n2+2n)−(3n2−4n+1)=6n−1(n≥2)u_n = (3n^2+2n)-(3n^2-4n+1) = 6n-1 \qquad (n\geq2)

Checking n=1n=1 in this formula: 6(1)−1=5=u16(1)-1=5=u_1, so in fact un=6n−1u_n=6n-1 holds for all n≥1n\geq1 here (not guaranteed in general — always check). Since un=6n−1u_n=6n-1 is linear in nn, the sequence is arithmetic with d=6d=6; indeed u5=6(5)−1=29u_5=6(5)-1=29.

6. Applications of Arithmetic Sequences

Arithmetic sequences model any situation with constant additive change per step: seating in rows of a theatre with a constant increase per row, a salary increasing by a fixed amount each year, simple (non-compound) interest, depreciation by a fixed amount per year, stacking objects in a triangular pile.

Worked example. A theatre has 2020 rows. The first row has 1818 seats, and each subsequent row has 22 more seats than the row before it. Find the number of seats in row 2020, and the theatre's total capacity.

This is arithmetic with u1=18u_1=18, d=2d=2, n=20n=20:

u20=18+(20−1)(2)=18+38=56 seats in the last rowu_{20} = 18+(20-1)(2) = 18+38=56 \text{ seats in the last row} S20=202(18+56)=10(74)=740 total seatsS_{20} = \frac{20}{2}(18+56) = 10(74) = 740 \text{ total seats}

7. Common Exam Pitfalls

  • Using ndnd instead of (n−1)d(n-1)d. The general term adds dd exactly n−1n-1 times from u1u_1, not nn times — check with n=1n=1: u1=u1+(1−1)d=u1u_1=u_1+(1-1)d=u_1, correctly adding nothing.
  • Confusing SnS_n (sum of first nn terms) with unu_n (the nnth term itself). A question asking for "the 2020th term" wants u20u_{20}; one asking for "the sum of the first 2020 terms" wants S20S_{20} — mixing these up is extremely common under time pressure.
  • Forgetting u1=S1u_1=S_1 is a special case when recovering terms from a sum formula — the relation un=Sn−Sn−1u_n=S_n-S_{n-1} only applies for n≥2n\geq2.
  • Miscounting the number of terms when inserting arithmetic means. Inserting kk means between aa and bb creates k+2k+2 terms total (including both endpoints), so b=uk+2b=u_{k+2}, not uk+1u_{k+1}.
  • Sign errors with a negative common difference. A decreasing sequence still uses the same formulas; substitute the negative value of dd carefully and keep track of signs through every multiplication.
  • Assuming every sequence with a sum formula is arithmetic. As the worked example in Section 5 shows, you must actually verify unu_n is linear in nn (or that consecutive differences are constant) before claiming the sequence is arithmetic.

Summary

  • An arithmetic sequence has constant common difference d=un+1−und=u_{n+1}-u_n, defined recursively by u1u_1 and un+1=un+du_{n+1}=u_n+d.
  • General term: un=u1+(n−1)du_n = u_1+(n-1)d, provable by induction from the recursive definition.
  • Given two terms um,unu_m, u_n, subtracting their general-term equations gives d=un−umn−md=\dfrac{u_n-u_m}{n-m} directly.
  • The arithmetic mean of a,ba,b is a+b2\dfrac{a+b}{2}; inserting kk means between aa and bb uses d=b−ak+1d=\dfrac{b-a}{k+1} over k+2k+2 total terms.
  • Sum of the first nn terms: Sn=n2(u1+un)=n2(2u1+(n−1)d)S_n=\dfrac{n}{2}(u_1+u_n) = \dfrac{n}{2}\big(2u_1+(n-1)d\big), derived by pairing the series with its reverse.
  • Any term can be recovered from sums via un=Sn−Sn−1u_n=S_n-S_{n-1} for n≥2n\geq2, and u1=S1u_1=S_1 — true for any sequence, not only arithmetic ones.
  • Arithmetic sequences model constant additive change per step: seating arrangements, simple interest, fixed salary increases, and similar applied contexts.