Geometric Sequences and Series

Learning goals

  • Divide consecutive terms for a constant ratio
  • Apply an=a1rn−1a_n = a_1 r^{n-1}, with n−1n - 1 multiplications
  • Prove the sum by shifting and subtracting
  • Exclude r=1r = 1, where the sum is nana instead
  • Separate growth in size from growth in value
  • Reach for logarithms when nn sits in the exponent

What makes a sequence geometric

A sequence is geometric when each term is the same fixed multiple of the term before it:

an+1=r⋅an.a_{n+1} = r \cdot a_n .

The number rr is the common ratio. Dividing both sides by ana_n shows where the name comes from:

r=an+1an,r = \frac{a_{n+1}}{a_n},

and this ratio is the same everywhere in the sequence. Arithmetic sequences keep a constant difference; geometric sequences keep a constant ratio. That is the whole distinction.

Two conditions ride along with the definition, and neither is a technicality. A geometric sequence is defined to have a1≠0a_1 \neq 0 and r≠0r \neq 0, precisely so the ratio r=an+1/anr = a_{n+1}/a_n always makes sense. If either one were 00, then every term from some point on would be 00, and that quotient would be a division by zero. Requiring a1≠0a_1 \neq 0 and r≠0r \neq 0 keeps every term nonzero and every ratio defined.

SequenceCommon ratio rrBehavior
3,  6,  12,  24,  483,\; 6,\; 12,\; 24,\; 4822the terms double
81,  27,  9,  3,  181,\; 27,\; 9,\; 3,\; 113\tfrac{1}{3}the terms shrink
5,  −10,  20,  −405,\; -10,\; 20,\; -40−2-2the signs alternate, the size grows
7,  7,  7,  77,\; 7,\; 7,\; 711nothing changes (watch this one)

To test a sequence, divide each term by the one before it. Every quotient the same means geometric; one mismatch means not. In 2,6,18,552, 6, 18, 55 the first two quotients are 6/2=36/2 = 3 and 18/6=318/6 = 3, but 55/1855/18 is not 33, so the sequence is not geometric. Note also that 3,6,9,123, 6, 9, 12 fails the test even though it looks orderly: 6/3=26/3 = 2 but 9/6=1.59/6 = 1.5. It is arithmetic (constant difference 33), not geometric.

The nth term, and the off-by-one hiding in it

The nnth term of a geometric sequence is an=a1r n−1a_n = a_1 r^{\,n-1}#

Start at a1a_1 and walk forward. The definition says each step multiplies by rr, so

a2=a1r,a3=a2r=(a1r)r=a1r2,a4=a3r=a1r3.a_2 = a_1 r, \qquad a_3 = a_2 r = (a_1 r) r = a_1 r^2, \qquad a_4 = a_3 r = a_1 r^3 .

The exponent is not the term number. It is one less, and counting the steps instead of the terms shows why. Between a1a_1 and ana_n there are n−1n - 1 gaps. Term 11 to term 22 is the first multiplication, term 22 to term 33 is the second, and the last one, term n−1n-1 to term nn, is the (n−1)(n-1)th. So traveling from a1a_1 to ana_n multiplies by rr exactly n−1n - 1 times, not nn times:

an=a1⋅r⋅r⋯r⏟n−1 factors=a1r n−1.a_n = a_1 \underbrace{\cdot r \cdot r \cdots r}_{n-1 \text{ factors}} = a_1 r^{\,n-1} .

Check the formula at the near end, where mistakes show up fastest. At n=1n = 1 it gives a1r0=a1a_1 r^0 = a_1, which is exactly right: you have not moved yet, so you have multiplied by nothing. An exponent of nn instead would report the first term as a1ra_1 r, which is the second term.

This is the same off-by-one you met in arithmetic sequences, where an=a1+(n−1)da_n = a_1 + (n-1)d for precisely the same reason: nn terms have only n−1n - 1 gaps between them. Only the operation changed, from n−1n-1 additions of dd to n−1n-1 multiplications by rr.

Four multiplications carry the first term to the fifthThe terms 3, 6, 12, 24, 48 in a row, joined by four arrows each labeled x2, showing that n terms are separated by only n minus 1 multiplications.a1a2a3a4a536122448x2x2x2x25 terms, only 4 multiplications
Five terms, but only four arrows. Each arrow is one multiplication by r, so reaching the fifth term takes four of them, and the fifth term is 3 times 2 to the fourth power.

Worked example 1 Find a formula and the 8th term of 5,  15,  45,  135,…5,\; 15,\; 45,\; 135,\ldots

First confirm the sequence really is geometric by dividing consecutive terms:

155=3,4515=3,13545=3.\frac{15}{5} = 3, \qquad \frac{45}{15} = 3, \qquad \frac{135}{45} = 3 .

Every quotient is 33, so r=3r = 3 and a1=5a_1 = 5. Substituting into an=a1r n−1a_n = a_1 r^{\,n-1} gives the explicit formula:

an=5⋅3 n−1.a_n = 5 \cdot 3^{\,n-1} .

For the eighth term, the exponent is 8−1=78 - 1 = 7, not 88:

a8=5⋅37=5⋅2187=10,935.a_8 = 5 \cdot 3^7 = 5 \cdot 2187 = 10{,}935 .

Check your understanding

In the geometric sequence 2,  −6,  18,  −54,…2,\; -6,\; 18,\; -54,\ldots, what is a7a_7?

Answer choices

Summing a finite geometric series

A geometric series is what you get when you add up the terms of a geometric sequence. Writing aa for the first term, the sum of the first nn terms is

Sn=a+ar+ar2+⋯+ar n−1.S_n = a + ar + ar^2 + \cdots + ar^{\,n-1} .

The same off-by-one appears again: there are nn terms, and the last exponent is n−1n - 1. You could add them one at a time, but there is a much faster way, and it is worth seeing in full.

For r≠1r \neq 1, the sum of the first nn terms is Sn=a(1−rn)1−rS_n = \dfrac{a(1 - r^n)}{1 - r}#

Write the sum, and underneath it write rr times the same sum. Multiplying by rr turns each term into the next one, so the second line is the first line shifted one place to the right:

Sn  =  a+ar+ar2+⋯+ar n−1rSn  =  a+ar+ar2+⋯+ar n−1+ar n\begin{aligned} S_n \;&=\; a + ar + ar^2 + \cdots + ar^{\,n-1} \\[2pt] rS_n \;&=\; \phantom{a + {}} ar + ar^2 + \cdots + ar^{\,n-1} + ar^{\,n} \end{aligned}

Now subtract the second line from the first. Every term of SnS_n except the leading aa also appears in rSnrS_n, and every term of rSnrS_n except the trailing ar nar^{\,n} also appears in SnS_n. Those shared terms, from arar all the way up to ar n−1ar^{\,n-1}, cancel in pairs, and only the two ends survive:

Sn−rSn=a−ar n.S_n - rS_n = a - ar^{\,n} .

Factor each side:

Sn(1−r)=a(1−r n).S_n(1 - r) = a(1 - r^{\,n}) .

This equation is true for every ratio rr, with no exceptions. The condition enters only at the final step. To isolate SnS_n you divide both sides by 1−r1 - r, and division is legal only when 1−r≠01 - r \neq 0, that is, only when r≠1r \neq 1. Assuming r≠1r \neq 1:

Sn=a(1−r n)1−r.S_n = \frac{a(1 - r^{\,n})}{1 - r} .

Test it on a sum you can check by hand. With a=3a = 3, r=2r = 2, and n=4n = 4 the formula gives 3(1−16)/(1−2)=3(−15)/(−1)=453(1 - 16)/(1 - 2) = 3(-15)/(-1) = 45, and indeed 3+6+12+24=453 + 6 + 12 + 24 = 45.

The shift-and-subtract cancellationS and rS written one above the other and offset by one column, so the four middle columns match and cancel on subtraction, leaving a from the top row and a r to the fifth from the bottom row.S =a+ar+ar2+ar3+ar4rS =ar+ar2+ar3+ar4+ar5every column in here cancels
Multiplying the sum by r shifts every term one place to the right. Subtract the rows and each shared column cancels, leaving only the first term of the top row and the last term of the bottom row.

Multiplying the numerator and denominator by −1-1 gives the same number in a second common form:

Sn=a(1−r n)1−r=a(r n−1)r−1.S_n = \frac{a(1 - r^{\,n})}{1 - r} = \frac{a(r^{\,n} - 1)}{r - 1} .

They are equal, so use whichever keeps the minus signs out of your way. When r>1r > 1 the right-hand form is tidier, because the denominator r−1r - 1 and the factor r n−1r^{\,n} - 1 are both positive there. Under that same condition the left-hand form makes both of those pieces negative, and relies on the two minus signs canceling. In summation notation the result reads

∑k=1nar k−1=a(1−r n)1−r,r≠1.\sum_{k=1}^{n} a r^{\,k-1} = \frac{a(1 - r^{\,n})}{1 - r}, \qquad r \neq 1 .

Worked example 2 Evaluate 3+6+12+⋯+3843 + 6 + 12 + \cdots + 384

The terms double, so a=3a = 3 and r=2r = 2. The formula needs the number of terms, and what you are given is the last term, so find nn first. Set an=384a_n = 384 and solve:

3⋅2 n−1=384⟹2 n−1=128=27⟹n−1=7,3 \cdot 2^{\,n-1} = 384 \quad\Longrightarrow\quad 2^{\,n-1} = 128 = 2^7 \quad\Longrightarrow\quad n - 1 = 7,

so n=8n = 8. There are eight terms, not 384384 of them, and not 77. Now apply the sum formula in the form built for r>1r > 1:

S8=3(28−1)2−1=3(256−1)1=3⋅255=765.S_8 = \frac{3(2^8 - 1)}{2 - 1} = \frac{3(256 - 1)}{1} = 3 \cdot 255 = 765 .

Adding by hand confirms it: 3+6+12+24+48+96+192+384=7653 + 6 + 12 + 24 + 48 + 96 + 192 + 384 = 765.

Worked example 3 Sum the first six terms of 2,  −6,  18,  −54,…2,\; -6,\; 18,\; -54,\ldots

Each term is −3-3 times the one before it, so a=2a = 2, r=−3r = -3, and n=6n = 6. Substitute carefully, because a negative ratio sets two sign traps at once:

S6=2(1−(−3)6)1−(−3).S_6 = \frac{2\bigl(1 - (-3)^6\bigr)}{1 - (-3)} .

The first trap is the exponent. Since 66 is even, (−3)6=+729(-3)^6 = +729, not −729-729. The second trap is the denominator: 1−(−3)=1+3=41 - (-3) = 1 + 3 = 4, not −2-2. With both handled,

S6=2(1−729)4=2(−728)4=−14564=−364.S_6 = \frac{2(1 - 729)}{4} = \frac{2(-728)}{4} = \frac{-1456}{4} = -364 .

Checking directly, 2−6+18−54+162−486=−3642 - 6 + 18 - 54 + 162 - 486 = -364. The sum is negative because the large negative terms outweigh the positive ones.

Check your understanding

What is the sum of the first 55 terms of the geometric sequence 4,  12,  36,…4,\; 12,\; 36,\ldots?

Answer choices

When the ratio is 1

The sum formula has a hole in it, and it is worth seeing exactly where.

Suppose r=1r = 1. Then every term is a⋅1 n−1=aa \cdot 1^{\,n-1} = a, so the sequence is a,a,a,…a, a, a, \ldots, which is genuinely geometric: the ratio really is constant. Adding nn copies of aa needs no clever trick at all:

Sn=a+a+⋯+a⏟n terms=na.S_n = \underbrace{a + a + \cdots + a}_{n \text{ terms}} = na .

Now try the formula on it. It reads

Sn=a(1−1 n)1−1=a⋅00,S_n = \frac{a(1 - 1^{\,n})}{1 - 1} = \frac{a \cdot 0}{0},

which is undefined. Nothing went wrong in the derivation; it simply stops one step short. The identity the derivation proved,

Sn(1−r)=a(1−r n),S_n(1 - r) = a(1 - r^{\,n}),

is still perfectly true at r=1r = 1, where it says Sn⋅0=0S_n \cdot 0 = 0. The trouble is that this statement is true for every value of SnS_n, so it pins down nothing at all. Multiplying by 1−r1 - r threw the information away, and no rearranging can bring it back. To get the sum you must return to the definition, which hands it over immediately: Sn=naS_n = na.

So the geometric sum formula carries a side condition, and it is not fine print.

Sn={a(1−r n)1−r,r≠1,na,r=1.S_n = \begin{cases} \dfrac{a(1 - r^{\,n})}{1 - r}, & r \neq 1, \\[10pt] na, & r = 1. \end{cases}

Only r=1r = 1 is excluded. The neighboring case r=−1r = -1 is perfectly fine, because the denominator becomes 1−(−1)=21 - (-1) = 2, which is nowhere near zero. For instance 5−5+5−55 - 5 + 5 - 5 has a=5a = 5, r=−1r = -1, n=4n = 4, and the formula gives 5(1−1)/2=05(1 - 1)/2 = 0, which is right: the four terms cancel in pairs.

Check your understanding

A geometric sequence has a1=7a_1 = 7 and common ratio r=1r = 1. What is the sum of its first 1212 terms?

Answer choices

Growth, decay, and the curve behind the sequence

Take absolute values of the defining rule an+1=rana_{n+1} = r a_n and you get ∣an+1∣=∣r∣⋅∣an∣|a_{n+1}| = |r| \cdot |a_n|, so the sizes of the terms are themselves a geometric sequence, with ratio ∣r∣|r|. That single line settles the growth question. If ∣r∣>1|r| > 1, each term is larger in size than the last, and the sizes grow without bound. If ∣r∣<1|r| < 1, each term is smaller in size than the last, and the sizes decay. If ∣r∣=1|r| = 1, the size never changes at all: the terms stay put when r=1r = 1 and flip sign forever when r=−1r = -1.

Read every word of that as a statement about size, not about which term is greater. With a1=−8a_1 = -8 and r=12r = \tfrac{1}{2} the terms run −8,−4,−2,−1-8, -4, -2, -1, and each one is greater than the last while steadily shrinking. The sign pattern is a separate question, decided by the signs of a1a_1 and rr. A positive ratio rr keeps every term on the same side of zero as a1a_1, while a negative ratio rr makes the terms alternate.

There is a familiar function hiding behind all this. Since r≠0r \neq 0 you may write

an=a1r n−1=a1r⋅r n=Cr n,C=a1r,a_n = a_1 r^{\,n-1} = \frac{a_1}{r} \cdot r^{\,n} = C r^{\,n}, \qquad C = \frac{a_1}{r},

and when r>0r > 0 and r≠1r \neq 1 that is precisely the exponential function f(x)=Cr xf(x) = C r^{\,x}, evaluated at x=1,2,3,…x = 1, 2, 3, \ldots instead of at every real number. A geometric sequence with r>0r > 0 and r≠1r \neq 1 is an exponential function sampled at the integers. Both exclusions are real, and they fail for different reasons. At r=1r = 1 the rule C⋅1 xC \cdot 1^{\,x} is a constant function, and an exponential base is never allowed to be 11. At r<0r < 0 the power r xr^{\,x} has no real value at most exponents (there is no real (−2)1/2(-2)^{1/2}), so no real exponential curve passes through the terms at all. With a negative ratio the terms simply alternate in sign, while their sizes march along the curve belonging to ∣r∣|r|. Everything you know about exponential growth and decay transfers straight across: a quantity growing by a fixed percentage each period has ratio r=1+p100r = 1 + \frac{p}{100} for a pp percent rise. Reading the value of that quantity once per period produces a geometric sequence.

A geometric sequence as an exponential curve sampled at the integersFive plotted points, at heights 3, 6, 12, 24 and 48, all lying on a single dashed exponential curve that continues past them.3612244812345nterm value
The five terms 3, 6, 12, 24, 48 sit exactly on one smooth exponential curve, read off only at the whole numbers n equals 1 through 5. A geometric sequence is an exponential function sampled at the integers.

Finding the number of terms with logarithms

In an=a1r n−1a_n = a_1 r^{\,n-1} the unknown nn sits in the exponent, which is exactly the situation logarithms were built for. Divide by a1a_1, take the logarithm of both sides, and bring the exponent down:

r n−1=ana1⟹(n−1)log⁡r=log⁡ ⁣(ana1)⟹n=1+log⁡(an/a1)log⁡r,r^{\,n-1} = \frac{a_n}{a_1} \quad\Longrightarrow\quad (n-1)\log r = \log\!\left(\frac{a_n}{a_1}\right) \quad\Longrightarrow\quad n = 1 + \frac{\log(a_n / a_1)}{\log r},

valid whenever r>0r > 0 and r≠1r \neq 1, so that log⁡r\log r exists and is not zero. When the target is a nice power (2 n−1=1282^{\,n-1} = 128, say) you can read the exponent off by inspection. When it is not, the logarithm does the work.

Worked example 4 How many terms of 5,  10,  20,  40,…5,\; 10,\; 20,\; 40,\ldots must be added before the sum first exceeds 10,00010{,}000?

Here a=5a = 5 and r=2r = 2, so the sum of the first nn terms simplifies neatly:

Sn=5(2 n−1)2−1=5(2 n−1).S_n = \frac{5(2^{\,n} - 1)}{2 - 1} = 5(2^{\,n} - 1).

Set up the requirement and clear away everything around the power of 22:

5(2 n−1)>10,000⟹2 n−1>2000⟹2 n>2001.5(2^{\,n} - 1) > 10{,}000 \quad\Longrightarrow\quad 2^{\,n} - 1 > 2000 \quad\Longrightarrow\quad 2^{\,n} > 2001 .

Now take logarithms. The logarithm is an increasing function, so it preserves the direction of the inequality:

nlog⁡2>log⁡2001⟹n>log⁡2001log⁡2≈3.30120.3010≈10.97.n \log 2 > \log 2001 \quad\Longrightarrow\quad n > \frac{\log 2001}{\log 2} \approx \frac{3.3012}{0.3010} \approx 10.97 .

The number of terms must be a whole number, so the first one that works is n=11n = 11. Check both sides of the boundary: S10=5(1024−1)=5115S_{10} = 5(1024 - 1) = 5115, which falls short, and S11=5(2048−1)=10,235S_{11} = 5(2048 - 1) = 10{,}235, which clears the target.

Worked example 5 A culture of 400400 bacteria triples every hour. After how many whole hours does it first pass one million?

Watch the indexing, because this is where the off-by-one bites in applications. The count at the start is a1=400a_1 = 400, which is the population after zero hours. One hour later you have a2a_2, so the population after hh hours is the (h+1)(h+1)th term:

ah+1=400⋅3 h.a_{h+1} = 400 \cdot 3^{\,h} .

Require that this pass one million and isolate the power:

400⋅3 h>1,000,000⟹3 h>2500.400 \cdot 3^{\,h} > 1{,}000{,}000 \quad\Longrightarrow\quad 3^{\,h} > 2500 .

Take logarithms of both sides and solve for hh:

h>log⁡2500log⁡3≈3.39790.4771≈7.12.h > \frac{\log 2500}{\log 3} \approx \frac{3.3979}{0.4771} \approx 7.12 .

Hours are whole numbers here, so the population first passes one million at h=8h = 8. Confirm it: 400⋅37=874,800400 \cdot 3^7 = 874{,}800, still under, while 400⋅38=2,624,400400 \cdot 3^8 = 2{,}624{,}400, comfortably over. Note that this eighth hour corresponds to the ninth term of the sequence, which is exactly the trap.

What happens if you never stop adding, and let the terms of a decaying geometric sequence pile up forever, is a genuinely different question. That question is the subject of the next lesson.

Common mistakes

Practice

Multiple Choice Questions (MCQ)

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

Core practice

Practice problems at the level of the course, to be worked out on paper. Hints one at a time, then the answer or the full worked solution, with your progress kept in this browser.

Core practice Work it out on paper 10 problems 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)

How would you prove something about a sum whose length nobody has told you? Modern algebra writes the letter nn and moves on. Greek mathematics had no symbol like nn or SnS_n to write instead.

Euclid, who taught in Alexandria, a port city in Egypt, around 300 BCE, proved it regardless. Proposition 35 of Book IX of his Elements states the sum of a geometric progression, wholly in the language of ratios. His argument reaches the same result as the shift and subtract you carried out earlier, though he never writes a shifted row of terms; he weighs the amount by which the second term exceeds the first against the amount by which the last term exceeds the first. Both comparisons produce the same ratio.

Then he does something odd with it. The very next proposition concerns perfect numbers, meaning numbers like 66 and 2828 that equal the total of their own smaller divisors. Euclid adds up 1+2+4+⋯1 + 2 + 4 + \cdots, and proves that whenever the running total is prime, that total times the last term is perfect. Try it. Here 1+2+4=71 + 2 + 4 = 7 is prime, and 7×4=287 \times 4 = 28.

Nobody has ever found an odd perfect number, and nobody has shown that none exists. So a sum of powers opened a question in 300 BCE that remains open today. The instrument that opened it is the formula you obtained by shifting the sum and subtracting.