Explore BrainMass
Share

# Recursive and Recurrence

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

1. Find the sequence for the recursive formula:
S_n = -s_n-1 + 9, s_0 = -3
(see the attachment for the full question)

2. True of False a_n = 2 is a solution to the recurrence relation a_n = 2a_n-1 - a_n-2 with initial conditions a_0 = 2 and a_1 = 2.
a. True
b. False

3. Find a solution to the recurrence relation:
a_n = 3na_n-1, a_0 = 2

© BrainMass Inc. brainmass.com March 22, 2019, 1:13 am ad1c9bdddf
https://brainmass.com/math/recurrence-relation/recursive-recurrence-528754

#### Solution Preview

** Please see the attached file for the complete solution **

Help 2

Recursive and Recurrence

1. Find the sequence for the recursive formula: (please see the attached file),

We have:
(please see the attached file)

We also have:
(please see the attached ...

#### Solution Summary

In this solution we solve several problems pertaining to recursively-defined sequences.

\$2.19