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

25 views

Suppose that $f (n) = 2f (n/2) + 3$ when $n$ is an even positive integer, and $f (1) = 5.$ Find

1. $f (2)$
2. $f (8)$
3. $f (64)$
4. $(1024)$

f(4)=2f(2)+3  =2(13)+3=29

f(8)=2f(4)+3 =61

and so on

## 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.$