×
×

# Is the sequence {an) a solution of the recurrence relation ISBN: 9780073383095 37

## Solution for problem 13E Chapter 2.4

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 1 306 Reviews
25
4
Problem 13E

Is the sequence {an) a solution of the recurrence relation an = —8an-1 + 16an-2 if Step-by-Step Solution:

Step 1 :

We have to find the given sequence is a solution of the recurrence relation if,

(a) Ans :yes, is solution of the recurrence relation since and  .’. is a solution of the recurrence relation Step 2 :

(b) Ans :no, is not a solution of the recurrence relation since and  .’. is not a solution of the recurrence relation Step 3 :

(c) ?

Ans :no, is not a solution of the recurrence relation since and  .’. is not a solution of the recurrence relation Step 4 :

(d) Ans : no, is not a solution of the recurrence relation since and  .’. is not a solution of the recurrence relation Step 5 of 8

Step 6 of 8

##### ISBN: 9780073383095

This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since the solution to 13E from 2.4 chapter was answered, more than 396 students have viewed the full step-by-step answer. This full solution covers the following key subjects: recurrence, relation, sequence, solution. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 13E from chapter: 2.4 was answered by , our top Math solution expert on 06/21/17, 07:45AM. The answer to “Is the sequence {an) a solution of the recurrence relation an = —8an-1 + 16an-2 if” is broken down into a number of easy to follow steps, and 16 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

Unlock Textbook Solution