Geometric Sequences: Explicit and Recursive Forms - College Algebra

SECTION 1

Historical Context & Motivation

The study of geometric sequences stretches back to antiquity, rooted in the practical need to understand quantities that grow or decay by a constant multiplicative factor. Ancient mathematicians in Babylon and Egypt encountered geometric progressions when computing compound interest on agricultural loans and estimating grain yields over successive harvests. The Greeks formalized these ideas within the broader framework of proportional reasoning, and the concept has since become indispensable across disciplines ranging from finance to biology. Understanding how these sequences were developed historically illuminates why we have two complementary representations—the explicit and recursive forms—each tailored to answer different kinds of questions.

c. 300 BCE • Euclid's Elements

Euclid defines geometric progressions in Elements Books VIII–IX, proving foundational results about continued proportion and linking them to the theory of numbers.

c. 250 BCE • Archimedes' Sand Reckoner

Archimedes uses geometric progressions with ratio 10⁸ to develop a numeration system capable of expressing astronomically large quantities, foreshadowing exponential notation.

1202 • Fibonacci's Liber Abaci

Leonardo of Pisa introduces European audiences to recursive reasoning and compound interest calculations, demonstrating geometric growth in financial contexts that remain central to modern applications.

1614 • Napier's Logarithms

John Napier publishes logarithmic tables constructed via geometric sequences, providing a computational bridge between multiplicative and additive structures that revolutionized scientific calculation.

18th–19th c. • Formal Series Theory

Euler, Gauss, and Cauchy develop convergence criteria for geometric series, establishing the rigorous analytic framework that underpins modern treatments of infinite sums and power series.

The central question that motivates this lesson is both simple and powerful: given a sequence in which each term is a fixed multiple of the previous one, how do we efficiently compute any term—whether the 5th or the 500th—and how do we express the relationship between consecutive terms in a form suitable for iterative computation? The explicit form answers the first question by providing a closed-formula that maps any index directly to its value, while the recursive form answers the second by defining each term in relation to its predecessor—a perspective that proves essential in computer algorithms, financial spreadsheets, and differential equation analogues.

SECTION 2

Core Principles & Definitions

A geometric sequence is an ordered list of numbers in which every term after the first is obtained by multiplying the preceding term by a fixed nonzero constant called the common ratio, denoted r. This single structural requirement—constant multiplicative change—generates a rich family of sequences that model exponential growth when |r| > 1 and exponential decay when 0 < |r| < 1. Before diving into formulas, it is essential to internalize the foundational ideas that distinguish geometric sequences from their arithmetic counterparts and from more general recursively defined sequences.

First Term (a₁)

The initial value that anchors the entire sequence. Every subsequent term is generated from a₁ through repeated multiplication by r. Changing a₁ scales every term proportionally without altering the growth pattern.

Common Ratio (r)

The constant factor between consecutive terms: r = aₙ₊₁ / aₙ for all valid n. The sign and magnitude of r determine whether the sequence grows, decays, oscillates, or alternates in sign.

Explicit (Closed) Form

The formula aₙ = a₁ · r⁽ⁿ⁻¹⁾ enables direct computation of any term without knowing its predecessors. It frames the sequence as an exponential function of the index n, making it ideal for random-access lookups.

Recursive Form

The pair of statements a₁ = (given value) and aₙ = r · aₙ₋₁ for n ≥ 2 defines the sequence iteratively. This form mirrors how spreadsheets, programming loops, and many natural processes actually generate successive values.

Divergence vs. Convergence

When |r| > 1 the terms grow without bound; when |r| < 1 they shrink toward zero; when r = −1 the sequence oscillates between ±a₁. This trichotomy governs whether the associated series converges.

✦

KEY TAKEAWAY

Think of a geometric sequence like a chain of gears in a transmission: the first gear (a₁) sets the initial motion, and the gear ratio (r) determines how each subsequent gear amplifies or reduces that motion. The explicit form is like knowing the total gear ratio from the engine to the nth wheel directly, while the recursive form is like tracing the torque through each gear in sequence. Both describe the same mechanical system, but each is optimized for a different engineering question.

SECTION 3

Visual Explanation: Plotting a Geometric Sequence

Visualizing a geometric sequence on a coordinate plane reveals its exponential character immediately. The following diagram plots the sequence with a₁ = 2 and r = 1.5, showing how the terms accelerate away from the horizontal axis as n increases. Unlike an arithmetic sequence—whose graph is a straight line—a geometric sequence traces out the discrete skeleton of an exponential curve, reinforcing the connection between geometric progressions and exponential functions.

Each cyan dot represents a term aₙ of the geometric sequence with a₁ = 2 and r = 1.5. The violet annotations between dots show the constant multiplicative factor of 1.5 linking each consecutive pair. The dashed curve traces the continuous exponential function f(x) = 2 · 1.5^(x−1) from which the discrete sequence is sampled.

Notice how the vertical spacing between successive dots increases as n grows—a hallmark of exponential behavior. The dashed curve connecting the points is the graph of the continuous exponential function f(x) = 2 · 1.5^(x−1), and the sequence values are simply this function evaluated at positive integers. This observation is not merely aesthetic: it establishes that the explicit formula aₙ = a₁ · r⁽ⁿ⁻¹⁾ is the discrete analogue of a continuous exponential, a connection that proves essential when modeling phenomena like compound interest, radioactive decay, or population growth in discrete time steps.

SECTION 4

Mathematical Framework

The algebraic machinery behind geometric sequences rests on two equivalent representations. Each encodes the same information—the initial term and the common ratio—but organizes it to serve different computational purposes. In this section we present both forms, derive their equivalence, and introduce the partial-sum formula that emerges naturally from the explicit representation.

RECURSIVE DEFINITION

a₁ = a₁ , aₙ = r · aₙ₋₁ for n ≥ 2

Here a₁ is the given first term and r is the common ratio (r ≠ 0). This pair of statements tells you how to compute the next term from the current one, but requires sequential evaluation from the beginning to reach any particular term.

EXPLICIT (CLOSED-FORM) FORMULA

aₙ = a₁ · r⁽ⁿ⁻¹⁾

aₙ = the nth term; a₁ = first term; r = common ratio; n = term index (positive integer). The exponent n − 1 counts the number of multiplications by r needed to reach aₙ from a₁.

Derivation of the Explicit Form from the Recursive Definition

Starting from the recursive definition, unwind the recursion step by step. We have a₂ = r · a₁, then a₃ = r · a₂ = r · (r · a₁) = r² · a₁, and more generally aₙ = rⁿ⁻¹ · a₁. This "telescoping" argument can be formalized by induction: assume aₖ = a₁ · r^(k−1) holds for some k ≥ 1. Then aₖ₊₁ = r · aₖ = r · a₁ · r^(k−1) = a₁ · r^k, confirming the formula for k + 1. By mathematical induction, the explicit form holds for all positive integers n.

COMMON RATIO FROM TWO TERMS

r = aₙ₊₁ / aₙ

This identity lets you extract r from any two consecutive terms. More generally, if you know aₘ and aₙ (m ≠ n), then r^(n−m) = aₙ / aₘ, so r = (aₙ / aₘ)^1/(n−m).

PARTIAL SUM OF A GEOMETRIC SEQUENCE

Sₙ = a₁ · (1 − rⁿ) / (1 − r) for r ≠ 1

Sₙ = sum of the first n terms. This formula is derived by writing Sₙ and r · Sₙ, subtracting to cancel interior terms, and solving for Sₙ. When |r| < 1 and n → ∞, the sum converges to a₁ / (1 − r).

SECTION 5

Explicit vs. Recursive: A Detailed Comparison

Both the explicit and recursive forms encode exactly the same sequence, yet they differ profoundly in computational strategy, conceptual emphasis, and practical utility. The explicit form treats the sequence as a function of n, enabling O(1) random access to any term. The recursive form treats the sequence as a process, generating each term from the one before it in O(n) time but offering a more natural description of step-by-step dynamics. The following diagram and table lay out these differences systematically.

Side-by-side flowcharts contrasting the explicit form (left, cyan) and recursive form (right, violet). The explicit path computes aₙ in a single evaluation; the recursive path must iterate from a₁ through every intermediate term.

Feature	Explicit Form	Recursive Form
Formula	aₙ = a₁ · r⁽ⁿ⁻¹⁾	a₁ given; aₙ = r · aₙ₋₁
Access Pattern	Direct (random access)	Sequential (from a₁ forward)
Best For	Finding a specific term quickly (e.g., the 100th term)	Generating lists of terms or modeling step-wise processes
Required Info	a₁, r, and the target index n	a₁, r, and all prior terms
Analogy	GPS coordinates (jump to any location)	Turn-by-turn directions (follow each step)

Comparison of explicit and recursive forms across key dimensions

💡

When Does the Choice Matter?

In many textbook problems, both forms yield the same answer with similar effort. The distinction becomes critical in practice: if you need the 500th term, the explicit form gives it in one calculation, whereas the recursive form would require 499 multiplications. Conversely, if you are programming a simulation that must track every intermediate value (e.g., a savings account balance each month), the recursive form is the natural choice because you need all prior terms anyway.

SECTION 6

Worked Example: From Sequence to Both Forms

Consider the geometric sequence 5, 15, 45, 135, …. We will identify the parameters, write both the explicit and recursive definitions, and use the explicit form to compute the 10th term.

Finding Both Forms and Computing a₁₀

1
Step 1 — Identify the First Term

The first element of the sequence is a₁ = 5. This is our anchor value, the starting point from which all subsequent terms are generated multiplicatively.

a₁ = 5
2
Step 2 — Determine the Common Ratio

Divide any term by its predecessor: r = a₂ / a₁ = 15 / 5 = 3. Verify with the next pair: a₃ / a₂ = 45 / 15 = 3. The constant ratio confirms this is indeed geometric.

r = 3
3
Step 3 — Write the Recursive Form

State the initial condition and the recurrence: a₁ = 5 and aₙ = 3 · aₙ₋₁ for n ≥ 2. This tells us that each term is exactly three times the previous term.

a₁ = 5 ; aₙ = 3 · aₙ₋₁
4
Step 4 — Write the Explicit Form

Substitute a₁ and r into the closed formula: aₙ = 5 · 3⁽ⁿ⁻¹⁾. This single expression gives any term directly as a function of n.

aₙ = 5 · 3⁽ⁿ⁻¹⁾
5
Step 5 — Compute the 10th Term

Set n = 10: a₁₀ = 5 · 3⁹ = 5 · 19 683 = 98 415. Without the explicit formula, we would have needed nine successive multiplications starting from 5.

a₁₀ = 98 415

SECTION 7

Strengths, Limitations & Special Cases

Geometric sequences are powerful modeling tools, but their applicability has clear boundaries. Understanding these boundaries—and the special values of r that produce distinctive behaviors—deepens your algebraic maturity and prepares you for series convergence tests in calculus.

Aspect	Strengths	Limitations
Modeling Power	Naturally models constant-percentage growth/decay: compound interest, half-life, depreciation, population doubling.	Cannot capture variable growth rates, logistic saturation, or non-multiplicative patterns.
Algebraic Simplicity	Closed-form expression allows direct computation and algebraic manipulation (solving for n, a₁, or r).	Numerical overflow/underflow for large \|r\| and large n; floating-point precision loss for r near 1.
Series Behavior	Infinite geometric series converge when \|r\| < 1, yielding a clean closed-form sum a₁/(1 − r).	Diverges for \|r\| ≥ 1; the partial sums grow without bound, limiting direct summation applications.
Flexibility	Extends to negative r (alternating signs) and fractional r (decay), covering a wide behavioral range.	r = 0 collapses the sequence to a₁, 0, 0, 0, … (degenerate case). r = 1 gives a constant sequence (technically geometric but trivial).

Strengths and limitations of geometric sequence models

⚠

SPECIAL CASE AWARENESS

When r is negative, the sequence alternates in sign—think of a spring oscillating about its equilibrium with diminishing amplitude when |r| < 1 or growing amplitude when |r| > 1. When r = −1, the terms flip between +a₁ and −a₁ indefinitely, producing a sequence that neither converges nor diverges to infinity. Always check the sign of r before interpreting the long-term behavior of a geometric model.

SECTION 8

Connections to Series, Finance & Beyond

The geometric sequence is not an isolated concept—it is the foundation upon which several major topics in mathematics and applied science are built. In this section we briefly survey the most important connections, providing a roadmap for where these ideas lead in subsequent coursework.

This Lesson	Where It Leads
Finite geometric sequence (n terms)	Geometric series Sₙ = a₁(1 − rⁿ)/(1 − r); convergent infinite series S = a₁/(1 − r) when \|r\| < 1
Explicit form aₙ = a₁ · r⁽ⁿ⁻¹⁾	Compound interest A = P(1 + i)ⁿ; present/future value of annuities in financial mathematics
Recursive form aₙ = r · aₙ₋₁	First-order linear recurrence relations; discrete dynamical systems; Markov chain transition models
Common ratio r	Eigenvalues of linear maps; ratio test and root test for series convergence in calculus II
Discrete exponential function	Continuous exponential f(t) = a · eᵏᵗ; differential equation dy/dt = ky

How geometric sequence concepts extend into advanced topics

Perhaps the most immediately practical extension is compound interest. If you invest a principal P at a periodic interest rate i, the balance after n periods is A = P(1 + i)ⁿ—precisely the explicit form of a geometric sequence with a₁ = P and r = 1 + i. Understanding this connection transforms the geometric sequence formula from an abstract algebraic object into a tool with genuine financial power: it lets you compute how long it takes an investment to double, compare loan payment structures, or evaluate the present value of future cash flows. These applications will be explored in depth in the financial mathematics unit of this course.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

A sequence is defined by a₁ = 7 and aₙ = −2 · aₙ₋₁ for n ≥ 2. Explain, without computing all the terms, why the sequence alternates in sign. What does the magnitude of each successive term do relative to the previous one, and does this sequence converge?

Show answer

The common ratio is r = −2, so each term is multiplied by a negative number, which flips the sign every step: positive → negative → positive → …. Because |r| = 2 > 1, the absolute value of each term doubles from one term to the next, meaning the terms grow without bound in magnitude. Consequently, the sequence diverges; it neither settles to a finite limit nor approaches zero. In formal terms, the sequence is unbounded and oscillating, which also means the corresponding geometric series diverges.

Question 2: BASIC CALCULATION

Find the 8th term of the geometric sequence whose first term is a₁ = 4 and whose common ratio is r = 1/2. Express your answer as a fraction.

Show answer

Apply the explicit formula: a₈ = a₁ · r⁷ = 4 · (1/2)⁷ = 4 · (1/128) = 4/128 = 1/32. Notice that the exponent is n − 1 = 7, not 8—a common source of error. Because r = 1/2, each term is half the previous one, so the terms decay toward zero. This is consistent with the general rule that |r| < 1 implies the sequence converges to 0.

Question 3: INTERMEDIATE

The 3rd term of a geometric sequence is 24 and the 7th term is 384. Find the common ratio r, the first term a₁, and write both the explicit and recursive forms of the sequence.

Show answer

From the explicit formula, a₇ = a₁ · r⁶ and a₃ = a₁ · r². Dividing: a₇/a₃ = r⁴ = 384/24 = 16, so r⁴ = 16, giving r = 2 (taking the positive real root; r = −2 also satisfies r⁴ = 16 and would produce an alternating sequence—context would determine which is appropriate). With r = 2: a₃ = a₁ · 4 = 24, so a₁ = 6. The explicit form is aₙ = 6 · 2⁽ⁿ⁻¹⁾; the recursive form is a₁ = 6, aₙ = 2 · aₙ₋₁ for n ≥ 2. Quick check: a₇ = 6 · 2⁶ = 6 · 64 = 384. ✓

Question 4: APPLIED

A pharmaceutical drug has a half-life of 6 hours in the bloodstream. A patient receives an initial dose of 400 mg. Modeling the drug concentration as a geometric sequence where each term represents the amount remaining after each successive 6-hour period, write the explicit formula and determine how much drug remains after 30 hours. Then use the recursive form to describe how a pharmacist might track the dosage computationally.

Show answer

Each 6-hour period halves the remaining drug, so r = 1/2 and a₁ = 400 mg. The explicit form is aₙ = 400 · (1/2)⁽ⁿ⁻¹⁾ where n counts the number of 6-hour periods elapsed (with n = 1 being the initial dose). After 30 hours, five half-lives have passed, so n = 6 (the amount after the 5th period): a₆ = 400 · (1/2)⁵ = 400/32 = 12.5 mg. For the recursive form, a₁ = 400 and aₙ = (1/2) · aₙ₋₁ for n ≥ 2. A pharmacist could implement this in a spreadsheet by placing 400 in cell A1 and the formula =A1*0.5 in A2, then copying downward—each cell iterates the recursion, providing a running log of drug concentration at each checkpoint.

Question 5: CRITICAL THINKING

Prove that if {aₙ} is a geometric sequence with positive terms and common ratio r > 0, then the sequence {bₙ} defined by bₙ = log(aₙ) is an arithmetic sequence. Identify the common difference of {bₙ} in terms of the original sequence's parameters. Discuss the conceptual significance of this relationship.

Show answer

Since aₙ = a₁ · r⁽ⁿ⁻¹⁾, taking logarithms (any base) yields bₙ = log(aₙ) = log(a₁) + (n − 1) · log(r). This is a linear function of n with slope log(r) and y-intercept log(a₁) − log(r). The common difference of {bₙ} is bₙ₊₁ − bₙ = log(r), which is constant, confirming that {bₙ} is arithmetic. This result is conceptually profound: the logarithm transforms multiplicative structure into additive structure, converting geometric progressions into arithmetic ones. This is precisely the principle that Napier exploited when inventing logarithms—multiplication reduces to addition—and it explains why logarithmic scales are used to linearize exponential data in fields from acoustics (decibels) to seismology (Richter scale).

SUMMARY

Lesson Summary

Summary

A geometric sequence is defined by a first term a₁ and a common ratio r that links every consecutive pair of terms multiplicatively. The explicit form aₙ = a₁ · r⁽ⁿ⁻¹⁾ provides direct, random-access computation of any term, while the recursive form aₙ = r · aₙ₋₁ captures the step-by-step generative process. When |r| > 1 the sequence diverges; when |r| < 1 it converges to zero; and when r < 0 the terms alternate in sign.

These two representations are algebraically equivalent but serve different purposes: the explicit form excels at computing specific terms and solving for unknown parameters, while the recursive form is the natural language of iterative computation and dynamic modeling. Together they connect to compound interest, geometric series, exponential functions, and discrete dynamical systems—making geometric sequences one of the most versatile structures in college algebra and beyond.