Purchase Solution

# Algebra: Simultaneous Recurrence Relations

Not what you're looking for?

Solve the simultaneous recurrence relations given below.

a(n) = 3a(n-1) + 2b(n-1)
b(n) = a(n-1) + 2b(n-1)

a(0) = 1
b(0) = 2

##### Solution Summary

The expert solves a system of two recurrence sequences.

##### Solution Preview

We have the following system:

Firstly, we'll subtract the second equation from the first one, and get:
(1)
Now, if we put n-1 instead of n, we'll get:
(2)

Then, from the first equation, we'll subtract from both sides, and get:
- = 2( - ) (3).

And now we'll substitute (2) in (3) and get:
- = 4 , which is same as ...

Solution provided by:
###### Education
• BSc, University of Bucharest
• MSc, Ovidius
• MSc, Stony Brook
• PhD (IP), Stony Brook
###### Recent Feedback
• "Thank you "
• "Thank You Chris this draft really helped me understand correlation."
• "Thanks for the prompt return. Going into the last meeting tonight before submission. "
• "Thank you for your promptness and great work. This will serve as a great guideline to assist with the completion of our project."
• "Thanks for the product. It is an excellent guideline for the group. "

##### Free BrainMass Quizzes

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.