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

Findf(n)whenn=2k, wherefsatisfies the recurrence relation

f(n)=8f(n/2)+n2 withf(1)=1.

Short Answer

Expert verified

The required expressions are:

f(n)=3·8log4n-2·16log4n

f4k=3·8k-2·16k

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

Given expression

f(n)=8f(n/4)+n2f(1)=1

02

Define the Recursive formula

A recursive formula is a formula that defines any term of a sequence in terms of its preceding terms.

03

Use the Recursive formula to findf(n)

Letak=f4kand usen=4k

localid="1668608368221" ak=8ak-1+42kak=8ak-1+16k40ao=f(1)ao=1

Letak=randak-1=1

r=8(Root Characteristic equation)

The solution of the recurrence relation is of the forman=α1r1n+α2r2nwhenr1andr2the distinct roots of the characteristic equation.

ak(h)=α·8kF(k)=16k

IfF(n)=btnt+bt-1nt-1++b1n+b0snand is not root of the characteristic equation, thenptnt+pt-1nt-1++p1n+p0snis the particular solution.

ak(p)=p0·16k

The particular solution needs to satisfy the recurrence relation:

an=8ak-1+16kp0.an=8p0·16k-1+16k8p0=16p0=2

Thus, the particular solution then becomes:

ak(p)=p0·16kak(p)=2·16k

The solution of the non-homogeneous recurrence relation is the sum of the solution of the homogeneous recurrence relation and the particular solution.

ak=α·8k-2·16k

04

Check the solution that satisfies the initial condition 

The solution needs to satisfy the initial conditiona0=1:

3=α

Then useak=f4k,n=4kandk=log4n:

f(n)=3.8log4n-2·16log4n

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

If G(x) is the generating function for the sequence{ak}, what is the generating function for each of these sequences?

a) 0,0,0,a3,a4,a5,(Assuming that terms follow the pattern of all but the first three terms)

b)a0,0,a1,0,a2,0,

c) 0,0,0,0,a0,a1,a2,(Assuming that terms follow the pattern of all but the first four terms)

d)a0,2a1,4a2,8a3,16a4,

e) 0,a0,a1/2,a2/3,a3/4, [Hint: Calculus required here.]

f) a0,a0+a1,a0+a1+a2,a0+a1+a2+a3,

Find a closed form for the generating function for each of these sequences. (For each sequence, use the most obvious choice of a sequence that follows the pattern of the initial terms listed.)

a) \(0,2,2,2,2,2,2,0,0,0,0,0, \ldots \)

b) \(0,0,0,1,1,1,1,1,1, \ldots \)

c) \(0,1,0,0,1,0,0,1,0,0,1, \ldots \)

d) \(2,4,8,16,32,64,128,256, \ldots \)

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

f) \(2, - 2,2, - 2,2, - 2,2, - 2, \ldots \)

g) \(1,1,0,1,1,1,1,1,1,1, \ldots \)

h) \(0,0,0,1,2,3,4, \ldots \)

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

Suppose that the function fsatisfies the recurrence relation f(n)=2f(n)+lognwhenever nis a perfect square greater than 1and f(2)=1.

a) Find f(16).

b) Give a big -Oestimate forf(n). [Hint: Make the substitution m=logn].

How many ternary strings of length six contain two consecutive 0's ?

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