A sequence is an ordered list of numbers, and each number in the list is called a term. Sequences are used to describe patterns in savings, population growth, computer algorithms, physics measurements, and many other situations. Recursion is a powerful way to build a sequence by using one or more earlier terms to generate the next term.
It helps students see a pattern as a process, not just as a finished list.
A recursive definition usually gives a starting value and a rule for finding later terms. An explicit definition gives a direct formula for the nth term, so you can jump straight to any position in the sequence. Arithmetic and geometric sequences often have both recursive and explicit forms, while sequences such as the Fibonacci sequence are naturally recursive.
Learning to move between recursive and explicit forms makes patterns easier to analyze, graph, and apply.
Understanding Math: Sequences and Recursion
A recursive rule is like a set of instructions that must be followed in order. You cannot find a later value until you know the earlier value it depends on. The initial value, sometimes called a base case, is essential.
Without it, the rule has nothing to start from. A rule that says add five each time could produce many different lists, depending on whether it starts at zero, ten, or a negative number.
When a rule uses two previous values, it needs two starting values. This is why the Fibonacci pattern begins with two given numbers.
The position matters just as much as the value. Students often make errors by treating the first position as zero when the definition begins at one. They may use the rule too early, before its stated starting position.
Read the condition carefully. If a rule applies from the second term onward, use it only after the first term has been established. Make a small table with one column for position and one for value.
Calculate each new row from the row above it. This simple layout makes it easier to catch a skipped step, a wrong sign, or an incorrect multiplication.
Different recursive rules create very different kinds of change. Adding a fixed amount produces steady change. If a bank balance gains twenty dollars every week, the graph rises in a straight line when position is plotted against value.
Multiplying by a fixed factor produces change that speeds up or shrinks quickly. Interest on savings, repeated discounts, bacterial growth under ideal conditions, and radioactive decay can be modeled this way for a limited time. A factor greater than one gives growth.
A positive factor between zero and one gives decay. A negative factor makes values switch between positive and negative, which creates an alternating pattern.
Recursion is especially useful in computing because a program can repeat the same instruction using earlier results. A spreadsheet can calculate a running balance when each cell refers to the cell before it. Scientists use recursive models when the present state depends on the previous state, such as a temperature reading adjusted over time.
Still, recursive calculations can become slow if a program repeatedly recalculates the same earlier values. Saving results as they are found avoids this waste.
When studying these patterns, focus on the starting information, the exact operation, the number of earlier terms used, and whether the values are changing by addition or multiplication. Those details determine the whole pattern.
Key Facts
- A sequence is written a1, a2, a3, ..., an, where n is the position number.
- Recursive arithmetic sequence: a1 = c, an = a(n - 1) + d for n >= 2.
- Explicit arithmetic sequence: an = a1 + (n - 1)d.
- Recursive geometric sequence: a1 = c, an = r a(n - 1) for n >= 2.
- Explicit geometric sequence: an = a1 r^(n - 1).
- Fibonacci sequence: F1 = 1, F2 = 1, Fn = F(n - 1) + F(n - 2) for n >= 3.
Vocabulary
- Sequence
- A sequence is an ordered list of terms that usually follow a pattern or rule.
- Term
- A term is one individual value in a sequence, such as a4 for the fourth value.
- Recursive definition
- A recursive definition gives starting term values and a rule that uses earlier terms to find later terms.
- Explicit definition
- An explicit definition gives a formula for an directly in terms of n.
- Common difference
- The common difference is the constant amount added to each term of an arithmetic sequence to get the next term.
Common Mistakes to Avoid
- Forgetting the initial condition is wrong because a recursive rule alone may describe many different sequences. Always include starting values such as a1 = 4 or F1 = 1, F2 = 1.
- Using n instead of n - 1 in an arithmetic explicit formula is wrong because the first term already occurs at n = 1. The formula an = a1 + (n - 1)d prevents adding the difference too many times.
- Treating every increasing sequence as arithmetic is wrong because equal growth in value is different from equal growth by ratio. Check whether differences are constant or ratios are constant before choosing a model.
- Trying to find a faraway recursive term without organizing intermediate terms is risky because each value depends on previous values. Make a table of n and an to avoid skipping or miscopying terms.
Practice Questions
- 1 A sequence is defined by a1 = 7 and an = a(n - 1) + 4 for n >= 2. Find a2, a3, a4, and an explicit formula for an.
- 2 A geometric sequence has a1 = 3 and recursive rule an = 2a(n - 1). Find a5 and write an explicit formula for an.
- 3 A student says the sequence 2, 4, 8, 16, ... is arithmetic because it keeps increasing. Explain why this is incorrect and identify the type of sequence and its recursive rule.