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

Find \(f(n)\) when\(n = {4^k}\), where \(f\) satisfies the recurrence relation\(f(n) = 5f(n/4) + 6n\), with\(f(1) = 1\).

Short Answer

Expert verified

The required expressions are:

\(\begin{array}{l}f(n) = {5^{{{\log }_4}n + 2}} - 6 \cdot {4^{{{\log }_4}n + 1}}\\f\left( {{4^k}} \right) = {5^{k + 2}} - 6 \cdot {4^{k + 1}}\end{array}\)

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

\(\begin{array}{c}f(n) = 5f(n/4) + 6n\\f(1) = 1\end{array}\)

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 find\(f(n)\)

Let \({a_k} = f\left( {{4^k}} \right)\) and use\(n = {4^k}\).

\(\begin{array}{l}{a_k} = 5{a_{k - 1}} + 6 \cdot {4^k}{a_0}\\{a_k} = f\left( {{4^0}} \right)\\{a_k} = f(1)\\{a_k} = 1\end{array}\)

\({a_k} = 5{a_{k - 1}}\)

Let \({a_k} = r\) and \({a_{k - 1}} = 1\)

\(r = 5\)(Root Characteristic equation)

The solution of the recurrence relation is of the form \({a_n} = {\alpha _1}r_1^n + {\alpha _2}r_2^n\) when \({r_1}\)and\({r_2}\)the distinct roots of the characteristic equation.

\(a_k^{(h)} = \alpha \cdot {5^k}\)

\(F(k) = 6 \cdot {4^k}\)

If \(F(n) = \left( {{b_t}{n^t} + {b_{t - 1}}{n^{t - 1}} + \ldots + {b_1}n + {b_0}} \right){s^n}\) and \(s\) is not \({\bf{a}}\)root of the characteristic equation, then \(\left( {{p_t}{n^t} + {p_{t - 1}}{n^{t - 1}} + \ldots + {p_1}n + {p_0}} \right){s^n}\) is the particular solution.

\(a_k^{(p)} = {p_0} \cdot {4^k}\)

The particular solution needs to satisfy the recurrence relation:

\(\begin{array}{l}{a_n} = 5{a_{k - 1}} + 6 \cdot {4^k}{p_0} \cdot {4^k}\\{a_n} = 5{p_0} \cdot {4^{k - 1}} + 6 \cdot {4^k}\end{array}\)

\(\begin{array}{l} - {p_0} = 24\\{p_0} = - 24\end{array}\)

Thus, the particular solution then becomes:

\(\begin{array}{l}a_k^{(p)} = {p_0} \cdot {4^k}\\a_k^{(p)} = - 24 \cdot {4^k}\end{array}\)

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

\(\begin{array}{l}{a_k} = a_k^{(h)} + a_k^{(p)}\\{a_k} = \alpha \cdot {5^k} - 24 \cdot {4^k}\end{array}\)

04

Check the solution that satisfies the initial condition

The solution needs to satisfy the initial condition \({a_0} = 1\) :

\(\begin{array}{l}1 = {a_0}\\{a_0} = \alpha \cdot {5^0} - 24 \cdot {4^0}1\\{a_0} = \alpha - 2425\\{a_0} = \alpha \end{array}\)

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

\(\begin{array}{l}{a_k} = \alpha \cdot {5^k} - 24 \cdot {4^k}\\{a_k} = 25 \cdot {5^k} - 24 \cdot {4^k}\\{a_k} = {5^{k + 2}} - 6 \cdot {4^{k + 1}}\end{array}\)

Then use \({a_k} = f\left( {{4^k}} \right),n = {4^k}\) and \(k = {\log _4}n\) :

\(\begin{array}{l}f(n) = f\left( {{4^k}} \right)\\f(n) = {5^{k + 2}} - 6 \cdot {4^{k + 1}}\\f(n) = {5^{{{\log }_4}n + 2}} - 6 \cdot {4^{{{\log }_4}n + 1}}\end{array}\)

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

Give a big-O estimate for the size of f in Exercise \(1{20}\) if f is an increasing function.

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

a) \({\left( {1 + {x^5} + {x^{10}} + {x^{15}} + \cdots } \right)^3}\)

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

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

d) \(\left( {{x^2} + {x^4} + {x^6} + {x^8} + \cdots } \right)\left( {{x^3} + {x^6} + {x^9} + } \right. \cdots \left( {{x^4} + {x^8} + {x^{12}} + \cdots } \right)\)

e) \(\left( {1 + {x^2} + {x^4} + {x^6} + {x^8} + \cdots } \right)\left( {1 + {x^4} + {x^8} + {x^{12}} + } \right. \cdots )\left( {1 + {x^6} + {x^{12}} + {x^{18}} + \cdots } \right)\)

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 \)

(a) Set up a divide-and-conquer recurrence relation for the number of multiplications required to computexn, where xis a real number and nis a positive integer, using the recursive algorithm from Exercise 26 in Section 5.4.

b) Use the recurrence relation you found in part (a) to construct a big- Oestimate for the number of multiplications used to compute xnusing the recursive algorithm.

How many comparisons are needed for a binary search in a set of 64 elements?

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