Recursive Sequences
Recursive Sequences
Recursive Sequences
Recursive Sequences
Topic Index | Algebra2/Trig Index | Regents Exam Prep Center
Recursion is the process of choosing a starting term and repeatedly applying the same process to each term
to arrive at the following term. Recursion requires that you know the value of the term immediately before the term you are trying to find. A recursive formula always has two parts: 1. the starting value for a1. 2. the recursion equation for an as a function of an-1 (the term before it.) Recursive formula: Same recursive formula:
Be sure you understand that the two formulas at the left say the same thing. Different textbooks write recursive formulas in different ways. Always 2 parts!
A recursive formula may list the first two (or more) terms as starting values, depending upon the natrue of the sequence. In such caes, the an portion of the formula is dependent upon the previous two (or more) terms..
Examples: 1.
Write the first four terms of the sequence:
In recursive formulas, each term is used to produce the next term. Follow the movement of the terms through the set up at the left.
Answer: -4, 1, 6, 11
2.
Explicit formula:
w w w .regentsprep.org/Regents/math/algtrig/ATP3/Recursive.htm
3.
1/2
3.
Explicit formula:
4.
Recursive formula:
5.
Notice how the value of n is used as the exponent for the value (-1). Also, remember that in recursive formulas, each term is used to produce the next term. Follow the movement of the terms through the set up at the left.
Check out how to use your TI83+/84+ graphing calculator with sequences and series. Click here.
Topic Index | Algebra2/Trig Index | Regents Exam Prep Center Created by Donna Roberts Copyright 1998-2012 http://regentsprep.org Oswego City School District Regents Exam Prep Center