Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Solve the recurrence relation T(n)=nT2(n/2)with the initial conditionT(1)=6whenn=2kfor some integer. [Hint: Letn=2kand then make the substitutionak=logT(2k)to obtain a linear non-homogeneous recurrence relation.]

Short Answer

Expert verified

Thus, the result is;

T(n)=6n4n-1n

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Linear Homogeneous Recurrence Relations with Constant Coefficients definition

Suppose that {an}satisfies the linear non-homogeneous recurrence relation

an=c1an-1+c2an-2++ckan-k+F(n),Wherec1,c2,,ckare real numbers, and

F(n)=(bfnt+bf-1nt-1++b1n+b0)sn,Whereb0,b1,,btandsare real numbers.

Whensis not a root of the characteristic equation of the associated linear homogeneous recurrence relation, there is a particular solution of the form(ptnt+pt-1nt-1++p1n+p0)sn

Whena root of this characteristic equation and its multiplicity is ism, there is a particular solution of the form:nm(ptnt+pt-1nt-1++p1n+p0)sn.

02

Use Recurrence Relations

Equation is:T(n)=nT2(n/2)T(1)=6

Let n=2kthen:T2k=2kT22k/2=2kT22k-1

Let ak=logT2kthen:

ak=log2T2kak=log22kT22k-1ak=log22k+log2T22k-1ak=k+log2T2k-12ak=k+2log2T2k-1ak=k+2ak-1

Thus we have then found the recurrence relation an=2an-1+nwith a0=log2T20=log2T(1)=log26.

03

Use Recurrence Relations again

Letan=r and an-1=2(other functions of nare considered to be 0)

The solution of the recurrence relation is then of the form; an=α1r1n+α2nr1n++αknk-1r1nwith r1a root with the multiplicity kof the characteristic equation.

an(h)=α·2n

Thus the solution of the homogeneous recurrence relation isan(h)=α·2n

If F(n)=btnt+bt-1nt-1++b1n+b0snand sis not a root of the characteristic equation, then ptnt+pt-1nt-1++p1n+p0snis the particular solution.

If F(n)=btnt+bt-1nt-1++b1n+b0snand sis a root of the characteristic equation with multiplicity m, thennmptnt+pt-1nt-1++p1n+p0snis the particular solution.

1 is not a root of the characteristic equation:

an(p)=p1n+p0·1n=p1n+p0

04

Check to satisfy the Recurrence Relation

The particular solution needs to satisfy the recurrence relation:

an=2an-1+np1n+p0an=2p1(n-1)+p0+np1n+p0an=2p1n-2p1+2p0+n0=p1n-2p1+p0+n0an=p1+1n+-2p1+p0

All coefficients then need to be zero p1+1=0-2p1+p0=0

Solve each equation p1=-1p0=2p1=2(-1)=-2.

The particular solution then becomes:an(p)=p1n+p0=-1n-2=-n-2

The solution of the non-homogeneous linear recurrence relation is the sum of the homogeneous an(h)and particular solutions an(p)which is:

an=an(h)+an(p)=α·2n-n-2

05

Evaluate and simplify

Evaluatean=α·2n-n-2 at n=0:

role="math" localid="1668581907140" log26=a0=20α-0-2log26=α-2

Combine like terms:log26+2=α

The solution of the non-homogeneous linear recurrence relation then becomes:

an=α·2n-n-2an=log26+2·2n-n-2an=log26·2n+2n+1-n-2

Since ak=log2T2kthen:log2T2k=log26·2n+2n+1-n-2

Take the exponential with the baseof each side:

T2k=2log2T2kT2k=2log26·2k+2k+1-k-2T2k=62k22k+12-k2-2T2k=62k222k2k22T2k=62k42k4·2k

Letn=2k, then:

.T(n)=T2kT(n)=62k42k4·2kT(n)=6n4n4·n

T(n)=6n4n-1n

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Use generating functions to solve the recurrence relation ak=3ak-1+2with the initial conditiona0=1.

Find the coefficient of \({x^9}\) in the power series of each of these functions.

a) \({\left( {1 + {x^3} + {x^6} + {x^9} + \cdots } \right)^3}\)

b) \({\left( {{x^2} + {x^3} + {x^4} + {x^5} + {x^6} + \cdots } \right)^3}\)

c) \(\left( {{x^3} + {x^5} + {x^6}} \right)\left( {{x^3} + {x^4}} \right)\left( {x + {x^2} + {x^3} + {x^4} + \cdots } \right)\)

d) \(\left( {x + {x^4} + {x^7} + {x^{10}} + \cdots } \right)\left( {{x^2} + {x^4} + {x^6} + {x^8} + } \right.\)\( \cdots )\)

e) \({\left( {1 + x + {x^2}} \right)^3}\)

Find a closed form for the generating function for each of these sequences. (Assume a general form for the terms of the sequence, using the most obvious choice of such a sequence.)

a) \( - 1, - 1, - 1, - 1, - 1, - 1, - 1,0,0,0,0,0,0, \ldots \)

b) \(1,3,9,27,81,243,729, \ldots \)

c) \(0,0,3, - 3,3, - 3,3, - 3, \ldots \)

d) \(1,2,1,1,1,1,1,1,1, \ldots \)

e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),2\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),{2^2}\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,{2^7}\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0, \ldots \)

f) \( - 3,3, - 3,3, - 3,3, \ldots \)

g) \(0,1, - 2,4, - 8,16, - 32,64, \ldots \)

h) \(1,0,1,0,1,0,1,0, \ldots \)

47. A new employee at an exciting new software company starts with a salary of550,000and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$ 10,000 for each year she has been with the company.

a) Construct a recurrence relation for her salary for hern th year of employment.

b) Solve this recurrence relation to find her salary for hern th year of employment.

Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form \(f(n){a_n} = g(n){a_{n - 1}} + h(n)\)Exercises 48-50 illustrate this.

To find number of edges and describe to make counting the edges easier.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free