Cogito
Integrated Math 1 · Chapter 5 · Lesson 3
Recursive and Explicit Rules
Two ways to describe the same list.
12 problems · about 21 minutes · F-BF.A.2, F-IF.A.3
Figure — use these to answer the problems
Warm Up
Straightforward practice. Get the method working first.
5 problemsaₙ = 6 + 5(n − 1). What is the 7th term?
AnswerWhy must a recursive rule state a starting value?
- Without one, the rule describes infinitely many sequences.
- It is only a writing convention.
a₁ = 2 and aₙ = aₙ₋₁ + 6. What is the 4th term?
Answera₁ = 3 and aₙ = 2aₙ₋₁. What is the 4th term?
Answeraₙ = 4 + 3(n − 1). What is the 6th term?
Answer
Build It Up
The same ideas with more to keep track of.
3 problemsaₙ = 5 · 2^(n−1). What is the 4th term?
AnswerWhich rule finds the 500th term without the earlier ones? 1 recursive, 2 explicit.
AnswerFibonacci: 1, 1, 2, 3, 5. What is the next term?
Answer
Stretch Yourself
Mixed problems. Work out what kind of question it is before you start.
4 problemsMatch each rule with what it needs to compute a term.
Draw a line from each item on the left to its match on the right.
- Recursive rule
- Explicit rule
- Any recursive rule at all
- The previous term
- Only the position number
- A stated starting value
aₙ = 10 + 4(n − 1). What is the 8th term?
AnswerThe Recursion
a₁ = 7 and aₙ = aₙ₋₁ + 5. What is the 3rd term?
AnswerThe Explicit Rule
aₙ = 7 + 5(n − 1). What is the 10th term?
Answer