Historical Context & Motivation
Humans have been fascinated by patterns in numbers for thousands of years. Long before modern algebra existed, mathematicians noticed that certain sequences—like the counting numbers 1, 2, 3, 4, … or the squares 1, 4, 9, 16, …—follow predictable rules. The challenge was finding a way to describe those rules precisely so that anyone could use them to predict future values.
Over time, two main strategies emerged. One approach says, "Give me the position number, and I'll tell you the value directly." The other says, "Give me the previous value, and I'll tell you how to get the next one." These two approaches are what we now call explicit functions and recursive functions. Understanding both gives you a complete toolkit for describing sequences and patterns.
Today, CCSS standard F-BF.1.a asks you to do exactly what these mathematicians did: look at a real-world situation or a number pattern and determine whether an explicit expression, a recursive process, or a set of calculation steps best captures the pattern. Let's learn how.
Core Principles & Definitions
Before we dive into examples, let's nail down the key vocabulary. A sequence is an ordered list of numbers that follows a pattern. Each number in the list is called a term. We use the notation aₙ to mean "the term at position n." So a₁ is the first term, a₂ is the second term, and so on.
Explicit Function
Recursive Function
Arithmetic Sequence
Geometric Sequence
Initial Condition
Visual Explanation: Explicit vs. Recursive
The diagram below shows the arithmetic sequence 4, 7, 10, 13, 16, … in two ways. On the left, the explicit approach draws a direct arrow from each position number n to its term value. On the right, the recursive approach shows how each term is built by adding 3 to the term before it. Notice how the explicit path is a single hop, while the recursive path chains through every preceding term.
Notice the key difference: with the explicit formula, if someone asks "What is the 100th term?" you just plug in n = 100 and compute 3(100) + 1 = 301. With the recursive formula, you would theoretically need to calculate all 99 terms before it to reach the 100th. Both formulas describe the same sequence, but they reveal different aspects of its structure.
Mathematical Framework
Let's formalize the two types of formulas for the two most common sequence families: arithmetic and geometric.
Arithmetic Sequences
Geometric Sequences
Choosing Between Explicit and Recursive
How do you decide which type of function to write? It depends on the context. Sometimes a problem naturally suggests one form over the other. The diagram below walks you through a decision-making process.
| Clue in the Problem | Form to Use | Example Wording |
|---|---|---|
| "Each week, the amount increases by $50" | Recursive (arithmetic) | a₁ = 200, aₙ = aₙ₋₁ + 50 |
| "The population doubles every year" | Recursive (geometric) | a₁ = 500, aₙ = 2 × aₙ₋₁ |
| "What is the value at week 52?" | Explicit (more efficient) | aₙ = 200 + (n − 1) × 50 |
| "Write a rule for the nth term" | Explicit | aₙ = a₁ + (n − 1)d or aₙ = a₁ × r⁽ⁿ⁻¹⁾ |
Worked Example
Let's work through a context-based problem from start to finish using both approaches.
Explicit vs. Recursive — Strengths & Limitations
Neither form is "better" in all situations. Each has strengths that make it the natural choice depending on what you need to do.
| Feature | Explicit Function | Recursive Function |
|---|---|---|
| Finding a distant term (e.g., a₁₀₀) | Fast—plug n = 100 directly into the formula. | Slow—you must calculate all 99 previous terms. |
| Ease of writing from context | May require algebra to simplify. | Often easier—the context literally tells you "add 5 each time." |
| Shows the overall pattern | Yes—you can see how aₙ depends on n globally. | No—focuses on local step-to-step changes. |
| Requires an initial condition | No—it's built into the formula. | Yes—always needs a₁ (or a₀) stated. |
| Best for computer programs / spreadsheets | Good for random access (jump to any row). | Great for looping (fill cells one at a time). |
Connection to Advanced Topics
The ideas you've learned here form the foundation for more advanced work in Algebra 2, Pre-Calculus, and beyond. Understanding explicit and recursive definitions prepares you for topics like series and summation notation, exponential growth models, and even mathematical induction (a proof technique that relies on recursive thinking).
| What You Learn Now | Where It Leads |
|---|---|
| Arithmetic explicit formula: aₙ = a₁ + (n − 1)d | Linear functions y = mx + b (d becomes the slope, a₁ − d becomes the y-intercept) |
| Geometric explicit formula: aₙ = a₁ × r⁽ⁿ⁻¹⁾ | Exponential functions y = a × bˣ (used in finance, biology, and physics) |
| Recursive definitions with initial conditions | Recursion in computer science, difference equations, mathematical induction |
| Summing terms of a sequence | Series, sigma notation (Σ), and eventually integral calculus |
In particular, the Fibonacci sequence (1, 1, 2, 3, 5, 8, …) is easy to define recursively—aₙ = aₙ₋₁ + aₙ₋₂ with a₁ = 1 and a₂ = 1—but its explicit formula involves irrational numbers and the golden ratio. This shows that not every recursive pattern translates neatly into a simple explicit formula, which is part of why mathematicians value both representations.
Practice Problems
Lesson Summary
In this lesson, you learned two fundamental ways to describe number patterns. An explicit function uses a formula like aₙ = a₁ + (n − 1)d (arithmetic) or aₙ = a₁ × r⁽ⁿ⁻¹⁾ (geometric) to jump directly to any term. A recursive function defines each term in relation to the previous one and always requires an initial condition (the value of a₁).
When a problem describes step-by-step changes ("each week, add 50"), a recursive form is the natural choice. When you need to find a distant term quickly or see the overall pattern, an explicit form is more efficient. The key to CCSS F-BF.1.a is reading the context carefully, identifying whether the sequence is arithmetic or geometric, extracting the common difference (d) or common ratio (r), and writing the appropriate function. With practice, you'll be able to move fluidly between both representations.