Follow these steps to evaluate a sequence defined recursively using a graphing calculator: •On the home screen, key in the value for the initial term a 1 and press [ENTER]. • Enter the recursive formula by keying in all numerical values given in the formula, along with the key strokes [2ND] ASS for the previous term a n − 1 .. Press [ENTER]. • Continue pressing [ENTER] to calculate the values for each successive term. For the following exercises, use the steps above to find the indicated term or terms for the sequence. 60. Find the first ten terms of the sequence a 1 = 8 , a n = ( a n − 1 + 1 ) ! a n − 1 !
Follow these steps to evaluate a sequence defined recursively using a graphing calculator: •On the home screen, key in the value for the initial term a 1 and press [ENTER]. • Enter the recursive formula by keying in all numerical values given in the formula, along with the key strokes [2ND] ASS for the previous term a n − 1 .. Press [ENTER]. • Continue pressing [ENTER] to calculate the values for each successive term. For the following exercises, use the steps above to find the indicated term or terms for the sequence. 60. Find the first ten terms of the sequence a 1 = 8 , a n = ( a n − 1 + 1 ) ! a n − 1 !
Follow these steps to evaluate a sequence defined recursively using a graphing calculator: •On the home screen, key in the value for the initial term
a
1
and press [ENTER]. • Enter the recursive formula by keying in all numerical values given in the formula, along with the key strokes [2ND] ASS for the previous term
a
n
−
1
.. Press [ENTER]. • Continue pressing [ENTER] to calculate the values for each successive term. For the following exercises, use the steps above to find the indicated term or terms for the sequence.
60. Find the first ten terms of the sequence
a
1
=
8
,
a
n
=
(
a
n
−
1
+
1
)
!
a
n
−
1
!
Write down the first five terms of the following recursively defined: sequence.
a₁2; an+1 = -2an +7
것이
a. -10, 30, -90, 270, -810
b. -13, -16, -19, -22, -25
c. -10, -13, -16, -19, -22
d. -10, -7, -4, -1, 2
Think back to the magical candy machine at your neighborhood grocery store. Suppose that the first time a
quarter is put into the machine 1 Skittle comes out. The second time, 3 Skittles, the third time 9 Skittles,
the fourth time, 27 Skittles, etc.
a. Find both a recursive and closed formula for how many Skittles the nth customer gets.
Recursive formula: an =
Closed formula:
an =
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, algebra and related others by exploring similar questions and additional content below.