Algebra 2 · Lesson 8.1 · Unit 8 · F-BF.2
Read the opening paragraph and the "The method" box on the lesson page. In your own words, restate each idea below.
A sequence is a function whose domain is the positive integers. \( a_n \) is the term at position \( n \).
An explicit rule gives \( a_n \) directly from \( n \), so any term can be found without the others.
A recursive rule gives each term from the previous one, and must state a starting value.
A recursive rule without a starting value is incomplete, since the pattern has no anchor.
To convert recursive to explicit, compute several terms and find the pattern in \( n \).
To convert explicit to recursive, ask what is done to \( a_{n-1} \) to reach \( a_n \).
Read the "Worked example" box. Then, without looking back, try writing your own answer below.
(a) For \( a_n = 3n + 2 \), list the first four terms and find \( a_{50} \). (b) Write a recursive rule for the same sequence. (c) For \( a_1 = 4 \) and \( a_n = 2a_{n-1} - 1 \), list four terms and find an explicit rule. (d) Explain when each form is the better choice.
In two or three sentences, explain this lesson's main idea to someone who has not read it.