Recursive Formula Arithmetic- Examples and Applications
What Is a Recursive Formula, Exactly?
A recursive formula defines each term of a sequence using the previous term(s). You don't get the 50th term handed to you — you have to calculate every single term before it to reach it.
This is both the power and the annoyance of recursive formulas. They're perfect for modeling situations where the next state depends on the current state, like compound interest, population growth, or anything that compounds over time.
The Basic Structure
Every recursive formula has two parts:
- Base case: The starting point. Usually a(1) = some value.
- Recursive step: a(n) = f(a(n-1)). The rule that gets you from one term to the next.
That's it. No magic, no complexity theater.
Arithmetic Sequence Recursive Formula
Arithmetic sequences add the same number each time. The recursive formula is straightforward:
a(1) = starting value
a(n) = a(n-1) + d
Where d is the common difference.
Example
Sequence: 5, 8, 11, 14, 17, ...
Recursive formula:
a(1) = 5
a(n) = a(n-1) + 3
To find the 10th term, you'd calculate: 5 → 8 → 11 → 14 → 17 → 20 → 23 → 26 → 29 → 32. The answer is 32.
Geometric Sequence Recursive Formula
Geometric sequences multiply by the same number each time. The recursive formula:
a(1) = starting value
a(n) = a(n-1) × r
Where r is the common ratio.
Example
Sequence: 3, 6, 12, 24, 48, ...
Recursive formula:
a(1) = 3
a(n) = a(n-1) × 2
To find the 8th term, you'd multiply by 2 seven times starting from 3. The answer is 384.
The Fibonacci Sequence
Fibonacci is the most famous recursive sequence. Each term is the sum of the two before it:
F(1) = 1, F(2) = 1
F(n) = F(n-1) + F(n-2)
Sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...
You'll see Fibonacci everywhere — in nature, computer algorithms, financial models. Not because it's mystical, but because many natural systems follow additive patterns.
Recursive vs. Explicit Formulas
Explicit formulas let you jump straight to any term. Recursive formulas make you work through the sequence.
| Aspect | Recursive | Explicit |
|---|---|---|
| Find term 50 | Calculate all 49 terms first | Plug in n=50 directly |
| Pattern clarity | Shows how terms connect | Shows direct relationship to n |
| Computation | Slow for large n | Fast for large n |
| Real-world modeling | Better for state-based systems | Better for direct calculations |
Where Recursive Formulas Actually Show Up
Compound Interest
If you invest $1,000 at 5% annual interest:
A(1) = 1000
A(n) = A(n-1) × 1.05
After 30 years: A(30) = 1000 × (1.05)^29 = $4,116. That's recursive in structure even if you'd use the explicit formula for speed.
Population Growth
Rabbit populations, bacterial growth, any system where "what you have now" determines "what you'll have next."
P(n) = P(n-1) + growth_rate × P(n-1)
Computer Science
Recursive algorithms use the same logic. Factorials:
0! = 1
n! = n × (n-1)!
Physics
Radioactive decay, projectile motion with air resistance — systems where current state depends on previous state with a constant multiplier.
How to Write a Recursive Formula (Practical)
Step 1: Identify the pattern. What's changing from term to term?
Step 2: Find the base case. What's your starting point?
Step 3: Express the relationship. How do you get from a(n-1) to a(n)?
Worked Example
Sequence: 7, 10, 13, 16, 19, ...
Pattern: Each term increases by 3.
Base case: a(1) = 7
Relationship: a(n) = a(n-1) + 3
That's your recursive formula.
Another Example
Sequence: 100, 50, 25, 12.5, ...
Pattern: Each term is half the previous term.
Base case: a(1) = 100
Relationship: a(n) = a(n-1) × 0.5
Common Mistakes
- Forgetting the base case. Without it, the formula is useless. You have to start somewhere.
- Off-by-one errors. a(n) refers to the nth term, a(n-1) is the term before it. Don't mix these up.
- Making it more complicated than it needs to be. If the pattern is "add 5," don't write "multiply by 1 and add 5." Just write "add 5."
When to Use Recursive vs. Explicit
Use recursive when:
- You're modeling real-world processes that evolve step-by-step
- The relationship between consecutive terms is the core insight
- You're writing code that processes sequences iteratively
Use explicit when:
- You need a specific term without calculating everything before it
- You're doing algebraic manipulation
- Speed matters and you have the formula
The Bottom Line
Recursive formulas aren't complicated. You define a starting point, then define how to get from one term to the next. That's the entire concept.
They matter because many real systems work this way — the future depends on the present, which depended on the past. If you're modeling anything that compounds, grows, decays, or evolves, recursive thinking is often the right tool.
Learn the basics, practice with a few sequences, and you'll recognize the pattern everywhere.