Marshall Blair

Mathematics

12 February, 09:28

Find the solution to each of these recurrence relations and initial conditions. use an iterative approach such as that used in example 10.

a. an = 3an-1, a0 = 2

b. an = an-1 + 2, a0 = 3

c. an = an-1 + n, a0 = 1

d. an = an-1 + 2n + 3, a0 = 4

e. an = 2an-1 - 1, a0 = 1 f) an = 3an-1 + 1, a0 = 1 g) an = nan-1, a0 = 5 h) an = 2nan-1, a0 = 1