Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

We will find the solution to the following Ihcc recurrence: an=-ban-1-9an-2 for n 2 with initial conditions = 3, a = 6. The first

image

We will find the solution to the following Ihcc recurrence: an=-ban-1-9an-2 for n 2 with initial conditions = 3, a = 6. The first step as usual is to find the characteristic equation by trying a solution of the "geometric" format an = r". (We assume also r # 0). In this case we get: -6-1-9-2 Since we are assuming r #0 we can divide by the smallest power of r, i.e., 2 to get the characteristic equation: 7-=-6r-9. (Notice since our Ihcc recurrence was degree 2, the characteristic equation is degree 2.) This characteristic equation has a single root r. (We say the root has multiplicity 2). Find r. r = Since the root is repeated, the general theory (Theorem 2 in section 5.2 of Rosen) tells us that the general solution to our Ihcc recurrence looks like: for suitable constants 1, 02. To find the values of these constants we have to use the initial conditions ao = 3, a = 6. These yield by using n=0 and n=1 in the formula above: and an = (r)" + (r)n Note the final solution of the recurrence is: 3= a(r) + a20(r) 6 = (r) + a(r) By plugging in your previously found numerical value for r and doing some algebra, find , 02: = 2 = (r) + (r)n where the numbers r, a; have been found by your work. This gives an explicit numerical formula in terms of n for the an an =

Step by Step Solution

3.43 Rating (150 Votes )

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Discrete Mathematics and Its Applications

Authors: Kenneth H. Rosen

7th edition

0073383090, 978-0073383095

More Books

Students also viewed these Mathematics questions

Question

Use Algorithm 3 to list all the 3-combinations of {1, 2, 3, 4, 5}.

Answered: 1 week ago

Question

In Exercise draw the given planar graph without any crossings.

Answered: 1 week ago