Sequences & Series

Study Sheet

Sequences & Series

Every Topic 9 idea, formula, and worked example on one desk reference

Sequences: Terms, Explicit & Recursive Rules

Concept
What is a Sequence?

A sequence is an ordered list of numbers called terms. We label them with subscripts: a1a_1 (first term), a2a_2 (second term), and in general ana_n (the nnth term). There are two ways to describe the pattern:

  • [leftmargin=*,itemsep=1pt]
  • Explicit rule: a formula for ana_n directly in terms of nn. Plug in nn to get any term instantly. Example: an=2n+1a_n = 2n+1.
  • Recursive rule: a starting term plus a formula that builds each term from the previous one. Example: a1=3, an=an1+2a_1 = 3,\ a_n = a_{n-1}+2.
Example
Worked Example: Explicit Rule

Find the first four terms of an=n21a_n = n^2 - 1.

a1=121=0a2=221=3a3=321=8a4=421=15\begin{aligned} a_1 &= 1^2 - 1 = 0\\ a_2 &= 2^2 - 1 = 3\\ a_3 &= 3^2 - 1 = 8\\ a_4 &= 4^2 - 1 = 15 \end{aligned}

The sequence is 0, 3, 8, 15, 0,\ 3,\ 8,\ 15,\ \dots

Example
Worked Example: Recursive Rule

Find the first four terms of a1=5, an=an1+4a_1 = 5,\ a_n = a_{n-1} + 4.

a1=5givena2=a1+4=5+4=9a3=a2+4=9+4=13a4=a3+4=13+4=17\begin{aligned} a_1 &= 5 &&\text{given}\\ a_2 &= a_1 + 4 = 5 + 4 = 9\\ a_3 &= a_2 + 4 = 9 + 4 = 13\\ a_4 &= a_3 + 4 = 13 + 4 = 17 \end{aligned}

The sequence is 5, 9, 13, 17, 5,\ 9,\ 13,\ 17,\ \dots

Tip

Tip. An explicit rule is a shortcut --- you can jump straight to a100a_{100}. A recursive rule must climb one step at a time. When a problem asks for a far-off term, look for an explicit formula.

Arithmetic Sequences

Concept
Common Difference and the nnth Term

A sequence is arithmetic when each term differs from the one before it by the same amount, the common difference dd. Test it by subtracting: d=a2a1=a3a2=d = a_2 - a_1 = a_3 - a_2 = \cdots

an=a1+(n1)d\boxed{\,a_n = a_1 + (n-1)d\,}

Here a1a_1 is the first term and dd is the common difference. Note the n1n-1: to reach the nnth term you take n1n-1 steps of size dd.

Example
Worked Example: Find a Specific Term

For 5, 8, 11, 14, 5,\ 8,\ 11,\ 14,\ \dots find a10a_{10}.

d=85=3,a1=5a10=a1+(101)d=5+9(3)=5+27=32\begin{aligned} d &= 8 - 5 = 3, \qquad a_1 = 5\\ a_{10} &= a_1 + (10-1)d\\ &= 5 + 9(3)\\ &= 5 + 27 = 32 \end{aligned}
Tip

Remember: arithmetic means ADD. You move from term to term by adding dd (a negative dd means the terms decrease). Do not confuse this with geometric sequences, which multiply.

Arithmetic Series (Partial Sums)

Concept
Summing an Arithmetic Sequence

A series is the sum of the terms of a sequence. The sum of the first nn terms of an arithmetic sequence is

Sn=n2(a1+an)\boxed{\,S_n = \frac{n}{2}\,(a_1 + a_n)\,}

Read it as: (number of terms) ×\times (average of the first and last term). If you do not yet know ana_n, find it first with an=a1+(n1)da_n = a_1 + (n-1)d.

Example
Worked Example: Sum of the First 10 Terms

Find S10S_{10} for 5, 8, 11, 14, 5,\ 8,\ 11,\ 14,\ \dots From the previous section, a10=32a_{10} = 32.

S10=102(a1+a10)=5(5+32)=5(37)=185\begin{aligned} S_{10} &= \frac{10}{2}\,(a_1 + a_{10})\\ &= 5\,(5 + 32)\\ &= 5(37) = 185 \end{aligned}
Example
Worked Example: Sum a Known Range

Find 2+4+6++1002 + 4 + 6 + \cdots + 100 (the first 5050 positive even numbers). Here a1=2a_1 = 2, a50=100a_{50} = 100, n=50n = 50.

S50=502(2+100)=25(102)=2550\begin{aligned} S_{50} &= \frac{50}{2}\,(2 + 100)\\ &= 25\,(102) = 2550 \end{aligned}

Geometric Sequences

Concept
Common Ratio and the nnth Term

A sequence is geometric when each term is a fixed multiple of the one before it, the common ratio rr. Test it by dividing: r=a2a1=a3a2=r = \dfrac{a_2}{a_1} = \dfrac{a_3}{a_2} = \cdots

an=a1rn1\boxed{\,a_n = a_1\, r^{\,n-1}\,}

Again note the exponent n1n-1: reaching the nnth term takes n1n-1 multiplications by rr.

Example
Worked Example: Find a Specific Term

For 3, 6, 12, 24, 3,\ 6,\ 12,\ 24,\ \dots find a7a_7.

r=63=2,a1=3a7=a1r71=326=364=192\begin{aligned} r &= \frac{6}{3} = 2, \qquad a_1 = 3\\ a_7 &= a_1\, r^{\,7-1} = 3\cdot 2^{6}\\ &= 3\cdot 64 = 192 \end{aligned}
Tip

Remember: geometric means MULTIPLY. Move from term to term by multiplying by rr. If r>1|r| > 1 the terms grow; if r<1|r| < 1 they shrink toward 00; a negative rr makes the signs alternate.

Geometric Series (Finite Sums)

Concept
Summing a Finite Geometric Sequence

The sum of the first nn terms of a geometric sequence (with r1r \ne 1) is

Sn=a11rn1r\boxed{\,S_n = a_1\,\frac{1 - r^{\,n}}{1 - r}\,}
Example
Worked Example: Sum of the First 6 Terms

Find S6S_6 for 3, 6, 12, 24, 3,\ 6,\ 12,\ 24,\ \dots where a1=3a_1 = 3 and r=2r = 2.

S6=a11r61r=312612=31641=3631=3(63)=189\begin{aligned} S_6 &= a_1\,\frac{1 - r^{6}}{1 - r}\\ &= 3\cdot\frac{1 - 2^{6}}{1 - 2}\\ &= 3\cdot\frac{1 - 64}{-1}\\ &= 3\cdot\frac{-63}{-1} = 3(63) = 189 \end{aligned}
Tip

Watch the signs. When r>1r > 1 both 1rn1 - r^n and 1r1 - r are negative, and the negatives cancel to give a positive sum. Compute the exponent rnr^n before subtracting.

Infinite Geometric Series

Concept
When Does an Infinite Sum Exist?

An infinite geometric series a1+a1r+a1r2+a_1 + a_1 r + a_1 r^2 + \cdots converges (adds up to a finite number) exactly when

r<1.|r| < 1.

In that case rn0r^n \to 0 as nn grows, and the finite formula collapses to

S=a11r(r<1).\boxed{\,S = \frac{a_1}{1 - r}\,}\qquad(|r| < 1).

If r1|r| \ge 1 the terms do not shrink, the partial sums run off to infinity, and the series diverges --- there is no sum.

Example
Worked Example: A Convergent Sum

Find 8+4+2+1+8 + 4 + 2 + 1 + \cdots Here a1=8a_1 = 8 and r=48=12r = \frac{4}{8} = \frac{1}{2}. Since r<1|r| < 1, the sum exists.

S=a11r=8112=812=16\begin{aligned} S &= \frac{a_1}{1 - r} = \frac{8}{1 - \frac12}\\ &= \frac{8}{\frac12} = 16 \end{aligned}
Example
Worked Example: A Repeating Decimal

Write 0.7=0.7+0.07+0.007+0.\overline{7} = 0.7 + 0.07 + 0.007 + \cdots as a fraction. This is geometric with a1=0.7a_1 = 0.7 and r=0.1r = 0.1.

S=0.710.1=0.70.9=79\begin{aligned} S &= \frac{0.7}{1 - 0.1} = \frac{0.7}{0.9} = \frac{7}{9} \end{aligned}
Tip

Always check r<1|r| < 1 first. An infinite geometric sum only exists when the ratio is between 1-1 and 11. If r1|r| \ge 1, the correct answer is “diverges (no sum).”

Summation (Sigma) Notation

Concept
Reading and Writing Σ\Sigma

The Greek capital sigma \sum is shorthand for “add these up.”

n=1kan=a1+a2+a3++ak\sum_{n=1}^{k} a_n = a_1 + a_2 + a_3 + \cdots + a_k

The letter nn is the index; it starts at the number written below \sum and climbs by 11 up to the number written above. Substitute each index value into the expression and add the results.

Example
Worked Example: Evaluate a Sum

Evaluate n=14(2n+1)\displaystyle\sum_{n=1}^{4}(2n+1).

=(21+1)+(22+1)+(23+1)+(24+1)=3+5+7+9=24\begin{aligned} &= (2\cdot1+1) + (2\cdot2+1) + (2\cdot3+1) + (2\cdot4+1)\\ &= 3 + 5 + 7 + 9 = 24 \end{aligned}
Example
Worked Example: Write in Sigma Notation

Write 3+6+9+12+153 + 6 + 9 + 12 + 15 using sigma notation. Each term is 3n3n for n=1n = 1 to 55:

3+6+9+12+15=n=153n3 + 6 + 9 + 12 + 15 = \sum_{n=1}^{5} 3n
Tip

Tip. If the index starts somewhere other than 11 (say n=3n=3), substitute exactly those values --- do not restart at 11. And a constant like k=153\sum_{k=1}^{5} 3 just adds that constant once per index value: 5×3=155 \times 3 = 15.

Applications

Concept
Choosing the Right Model

Real-world patterns are often sequences or series. Decide which type first:

  • [leftmargin=*,itemsep=1pt]
  • Repeated adding (a fixed raise, a fixed monthly deposit) \Rightarrow arithmetic.
  • Repeated multiplying (a percent growth or decay, compound interest, a ball rebounding to a fraction of its height) \Rightarrow geometric.
  • “How high is the nnth bounce?” or “salary in year nn?” asks for a single term. “Total distance” or “total earned” asks for a series (sum).
Example
Worked Example: Depreciation (Geometric Term)

A machine worth $50,000 loses 20%20\% of its value each year, so it keeps 80%80\%: r=0.8r = 0.8. Find its value after 55 years, i.e. the term an=50000(0.8)na_n = 50000\,(0.8)^{n} at n=5n = 5.

a5=50000(0.8)5=50000(0.32768)=$16,384\begin{aligned} a_5 &= 50000\,(0.8)^{5}\\ &= 50000\,(0.32768)\\ &= \$16{,}384 \end{aligned}
Example
Worked Example: Bouncing Ball (Infinite Series)

A ball dropped from 1010 m rebounds to 60%60\% of its previous height. Find the total vertical distance it travels before resting. It falls 1010 m, then each rebound goes up and back down. The rebound heights 6,3.6,2.16,6, 3.6, 2.16, \dots are geometric with a1=6a_1 = 6, r=0.6r = 0.6.

rebound sum=610.6=60.4=15 mtotal=10+2(15)=40 m\begin{aligned} \text{rebound sum} &= \frac{6}{1 - 0.6} = \frac{6}{0.4} = 15\ \text{m}\\ \text{total} &= 10 + 2(15) = 40\ \text{m} \end{aligned}

The factor of 22 counts each rebound up and down; the initial 1010 m drop is counted once.

Example
Worked Example: Salary Raises (Arithmetic Series)

You start at $35,000 and receive a $1,500 raise each year. Total earned over 1010 years? Arithmetic with a1=35000a_1 = 35000, d=1500d = 1500.

a10=35000+(101)(1500)=35000+13500=48500S10=102(35000+48500)=5(83500)=$417,500\begin{aligned} a_{10} &= 35000 + (10-1)(1500) = 35000 + 13500 = 48500\\ S_{10} &= \frac{10}{2}\,(35000 + 48500)\\ &= 5\,(83500) = \$417{,}500 \end{aligned}

Going Deeper: Advanced Sequences & Series

Concept
Telescoping Sums

A sum telescopes when each term splits into two pieces that cancel against neighbors, leaving only the very first and very last. The trick is partial fractions: rewrite the general term as a difference bkbk+1b_k - b_{k+1}. Then

k=1n(bkbk+1)=b1bn+1,\sum_{k=1}^{n}\bigl(b_k - b_{k+1}\bigr) = b_1 - b_{n+1},

because every interior piece appears once with a ++ and once with a -. The classic case:

1k(k+1)=1k1k+1.\frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}.
Example
Worked Example: A Telescoping Sum

Evaluate k=1n1k(k+1)\displaystyle\sum_{k=1}^{n}\frac{1}{k(k+1)}, then take nn \to \infty. Split each term with partial fractions:

k=1n1k(k+1)=k=1n(1k1k+1)=(112)+(1213)++(1n1n+1)=11n+1.\begin{aligned} \sum_{k=1}^{n}\frac{1}{k(k+1)} &= \sum_{k=1}^{n}\left(\frac{1}{k} - \frac{1}{k+1}\right)\\ &= \left(1 - \tfrac12\right) + \left(\tfrac12 - \tfrac13\right) + \cdots + \left(\tfrac1n - \tfrac{1}{n+1}\right)\\ &= 1 - \frac{1}{n+1}. \end{aligned}

As nn \to \infty, 1n+10\dfrac{1}{n+1} \to 0, so the infinite sum equals 1\boxed{1}.

Concept
Power Sums and the Cube Identity

Three closed forms let you sum powers of the first nn whole numbers without adding term by term:

k=1nk=n(n+1)2,k=1nk2=n(n+1)(2n+1)6,k=1nk3=(n(n+1)2) ⁣2.\begin{aligned} \sum_{k=1}^{n} k &= \frac{n(n+1)}{2},\\ \sum_{k=1}^{n} k^2 &= \frac{n(n+1)(2n+1)}{6},\\ \sum_{k=1}^{n} k^3 &= \left(\frac{n(n+1)}{2}\right)^{\!2}. \end{aligned}

The last line hides a beautiful identity: the sum of the first nn cubes is the square of the sum of the first nn whole numbers,

 k=1nk3=(k=1nk) ⁣2 .\boxed{\ \sum_{k=1}^{n} k^3 = \left(\sum_{k=1}^{n} k\right)^{\!2}\ }.

For example 1+8+27+64=100=(1+2+3+4)2=1021 + 8 + 27 + 64 = 100 = (1+2+3+4)^2 = 10^2.

Tip

Break sums apart. A sum like (3k25k+2)\sum(3k^2 - 5k + 2) splits by linearity: 3k25k+23\sum k^2 - 5\sum k + \sum 2. Handle each power sum with its own formula, remembering k=1nc=cn\sum_{k=1}^{n} c = cn for a constant.

Example
Worked Example: Arithmetic--Geometric Sum krk\sum k\,r^k

Terms like krkk\,r^k mix an arithmetic factor (kk) with a geometric one (rkr^k). Evaluate S=k=1k(12)k\displaystyle S = \sum_{k=1}^{\infty} k\left(\tfrac12\right)^{k} using the shift-and-subtract trick. First check convergence: here r=12r = \tfrac12, and since r<1|r| < 1 the sum exists. Write the finite sum Sn=k=1nkrkS_n = \sum_{k=1}^{n} k r^k and subtract rSnrS_n:

SnrSn=(r+2r2+3r3++nrn)(r2+2r3++nrn+1)(1r)Sn=r+r2+r3++rnnrn+1(1r)Sn=r(1rn)1rnrn+1.\begin{aligned} S_n - rS_n &= \bigl(r + 2r^2 + 3r^3 + \cdots + nr^n\bigr) - \bigl(r^2 + 2r^3 + \cdots + nr^{n+1}\bigr)\\ (1-r)S_n &= r + r^2 + r^3 + \cdots + r^n - nr^{n+1}\\ (1-r)S_n &= \frac{r\bigl(1 - r^{n}\bigr)}{1 - r} - nr^{n+1}. \end{aligned}

With r<1|r| < 1, both rn0r^n \to 0 and nrn+10nr^{n+1} \to 0 as nn \to \infty, leaving the tidy formula

k=1krk=r(1r)2(r<1).\sum_{k=1}^{\infty} k\,r^k = \frac{r}{(1-r)^2}\qquad(|r| < 1).

Now substitute r=12r = \tfrac12:

S=12(112)2=1214=2.\begin{aligned} S &= \frac{\tfrac12}{\left(1 - \tfrac12\right)^2} = \frac{\tfrac12}{\tfrac14} = 2. \end{aligned}

So 12+24+38+416+=2\tfrac12 + \tfrac24 + \tfrac38 + \tfrac{4}{16} + \cdots = \boxed{2}.

Example
Worked Example: Recurrence to a Closed Form

Turn the recursive rule a1=3, an=2an1+1a_1 = 3,\ a_n = 2a_{n-1} + 1 into an explicit formula. First find the fixed point LL that the constant term wants to settle at, by solving L=2L+1L = 2L + 1, which gives L=1L = -1. Add 11 to both sides of the recurrence and the “+1+1” disappears:

an+1=2an1+2=2(an1+1).\begin{aligned} a_n + 1 &= 2a_{n-1} + 2 = 2\bigl(a_{n-1} + 1\bigr). \end{aligned}

So the shifted sequence bn=an+1b_n = a_n + 1 is geometric with ratio 22 and first term b1=a1+1=4b_1 = a_1 + 1 = 4. Therefore

bn=42n1=2n+1,an=bn1=2n+11.\begin{aligned} b_n &= 4 \cdot 2^{\,n-1} = 2^{\,n+1},\\ a_n &= b_n - 1 = 2^{\,n+1} - 1. \end{aligned}

Check: a1=221=3a_1 = 2^2 - 1 = 3, a2=231=7a_2 = 2^3 - 1 = 7, a3=241=15a_3 = 2^4 - 1 = 15. Matches 3,7,15,31,3, 7, 15, 31, \dots

Concept
Mathematical Induction

Induction proves a statement P(n)P(n) is true for every whole number n1n \ge 1 using two steps, like knocking over an infinite line of dominoes:

  • [leftmargin=*,itemsep=1pt]
  • Base case: show P(1)P(1) is true (the first domino falls).
  • Inductive step: assume P(k)P(k) is true (the inductive hypothesis) and use it to prove P(k+1)P(k+1) (each domino knocks over the next).

Together these force P(n)P(n) true for all n1n \ge 1.

Example
Worked Example: A Full Induction Proof

Claim. For every integer n1n \ge 1, k=1n(2k1)=n2\displaystyle\sum_{k=1}^{n}(2k-1) = n^2 (the sum of the first nn odd numbers).

Base case (n=1n = 1). The left side is 2(1)1=12(1) - 1 = 1; the right side is 12=11^2 = 1. They agree, so P(1)P(1) holds.

Inductive step. Assume the formula holds for some n=kn = k; that is, assume

i=1k(2i1)=k2.(inductive hypothesis)\sum_{i=1}^{k}(2i-1) = k^2. \qquad\text{(inductive hypothesis)}

We must show it holds for n=k+1n = k+1, i.e. that the sum equals (k+1)2(k+1)^2. Start from the (k+1)(k+1)-term sum and peel off the last term:

i=1k+1(2i1)=i=1k(2i1)=k2 by hypothesis+(2(k+1)1)=k2+(2k+1)=k2+2k+1=(k+1)2.\begin{aligned} \sum_{i=1}^{k+1}(2i-1) &= \underbrace{\sum_{i=1}^{k}(2i-1)}_{=\,k^2 \text{ by hypothesis}} + \bigl(2(k+1)-1\bigr)\\ &= k^2 + (2k + 1)\\ &= k^2 + 2k + 1\\ &= (k+1)^2. \end{aligned}

This is exactly P(k+1)P(k+1). By the principle of mathematical induction, the formula holds for all n1n \ge 1. \blacksquare

Concept
Infinite Geometric Series in Disguise

Many word problems hide a convergent geometric series. The pattern is always the same: identify a1a_1 and rr, confirm r<1|r| < 1, then apply S=a11rS = \dfrac{a_1}{1-r}.

  • [leftmargin=*,itemsep=1pt]
  • Repeating decimals: 0.d0.\overline{d} is a geometric series with r=0.1r = 0.1 (or r=0.01r = 0.01 for two repeating digits).
  • Bouncing ball: rebound heights shrink by a fixed fraction rr each bounce.
  • Perpetuity / annuity: a payment made every period, discounted by 11+i\dfrac{1}{1+i} per period, has r=11+i<1r = \dfrac{1}{1+i} < 1 whenever the interest rate i>0i > 0.
Example
Worked Example: Present Value of a Perpetuity (Annuity)

An endowment pays $100 at the end of every year forever, and money is discounted at i=5%i = 5\% per year. Its present value is the sum of all payments discounted back to today:

PV=1001.05+1001.052+1001.053+\text{PV} = \frac{100}{1.05} + \frac{100}{1.05^2} + \frac{100}{1.05^3} + \cdots

This is geometric with a1=1001.05a_1 = \dfrac{100}{1.05} and r=11.05r = \dfrac{1}{1.05}. Since i>0i > 0 we have r<1r < 1, so the sum converges:

PV=a11r=100/1.0511/1.05=100/1.050.05/1.05=1000.05=$2000.\begin{aligned} \text{PV} &= \frac{a_1}{1 - r} = \frac{100/1.05}{1 - 1/1.05}\\ &= \frac{100/1.05}{\,0.05/1.05\,}\\ &= \frac{100}{0.05} = \$2000. \end{aligned}

A perpetual stream of $100 per year is worth just $2000 today --- a clean shortcut: PV=paymenti\text{PV} = \dfrac{\text{payment}}{i}.

Tip

Advanced pitfalls. (1) For krk\sum k\,r^k and other infinite sums, always verify r<1|r| < 1 before writing a finite answer. (2) Partial fractions only telescope if the pieces truly cancel --- write out three terms to confirm. (3) An induction proof is incomplete without both the base case and an inductive step that explicitly uses the hypothesis.

Formulas, Proofs & Tips

Tip
Arithmetic sequences and series
an=a1+(n1)d,Sn=n2(a1+an)a_n=a_1+(n-1)d,\qquad S_n=\frac{n}{2}\left(a_1+a_n\right)

What it means. A constant is added each step; the sum is the number of terms times the average of the first and last.

Example. 3,7,11,3,7,11,\dots: a5=3+44=19a_5=3+4\cdot 4=19 and S5=52(3+19)=55S_5=\tfrac52(3+19)=55.

Why it works. Getting to the nnth term takes n1n-1 steps of size dd. For the sum, write SnS_n forwards and backwards and add: every column totals a1+ana_1+a_n, and there are nn columns, giving 2Sn=n(a1+an)2S_n=n(a_1+a_n).

Tip. It is n1n-1, not nn — the first term takes no steps. Check with n=1n=1.

Tip
Geometric sequences and series
an=a1rn1,Sn=a11rn1r,S=a11r  (r<1)a_n=a_1r^{\,n-1},\qquad S_n=a_1\frac{1-r^{n}}{1-r},\qquad S_\infty=\frac{a_1}{1-r}\ \ (|r|<1)

What it means. A constant multiplier each step. If the ratio is small enough the infinite sum settles on a finite number.

Example. 2,6,18,2,6,18,\dots: a4=233=54a_4=2\cdot 3^3=54 and S4=23412=80S_4=2\cdot\tfrac{3^4-1}{2}=80.

Why it works. For the finite sum, subtract rSnrS_n from SnS_n: every middle term cancels, leaving Sn(1r)=a1(1rn)S_n(1-r)=a_1(1-r^{n}). When r<1|r|<1, rn0r^{n}\to 0 as nn grows, which collapses the numerator to 11.

Tip. The infinite formula needs r<1|r|<1. If r1|r|\ge 1 the terms do not shrink and the sum diverges.