# Kenneth Rosen Edition 7th Exercise 8.3 Question 12 (Page No. 535)

1 vote
77 views
Find $f (n)$ when $n = 3k,$ where $f$ satisfies the recurrence relation $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$

### Hope this helps!

0
for me it is also helpful, many thanks!

Use Master Theorem with$a = 2, b = 3, c = 4, d = 0$.

Since $a > b^{d}, (d<log_{b}a)$

we know that f(n) is $O(n^{ log_{b }a} ) = O(n ^{log_{3} 2} ).$

## Related questions

1
267 views
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
Suppose that there are $n = 2^{k}$ teams in an elimination tournament, where there are $\frac{n}{2}$ games in the first round, with the $\frac{n}{2} = 2^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$