Find the solution to each of these recurrence relations and initial conditions. Use an iterative approach such as that used in Example 10.
In this problem we have to find the solution for these recurrence relation, where we given the initial condition.
a: the recurrence relation is given as
an = 3 an-1 with a0= 2
Now we starting with initial condition a0 = 2 and working upward until we reach an to deduce a closed formula for the sequence. Then
We put n = 0 ,1,2,3,4……...so on , Then
a1 = 3 a0 = 3.2
a2 = 3a2-1
a2 = 3a1 = 3.3.2 = 32.2
a3 = 3a3-1
a3 = 3a2 = 3.32.2 = 33.2
an = 3an-1 = 3n.2
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
This full solution covers the following key subjects: approach, conditions, Example, Find, initial. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The answer to “?Find the solution to each of these recurrence relations and initial conditions. Use an iterative approach such as that used in Example 10.a) b) c) d) e) f) g) h)” is broken down into a number of easy to follow steps, and 30 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since the solution to 17E from 2.4 chapter was answered, more than 466 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 17E from chapter: 2.4 was answered by , our top Math solution expert on 06/21/17, 07:45AM.