I am trying to do the exercise 01, chapter 02 of the book: Algorithm Design [Kleinberg _ Tardos] - publication version 03 of the book
I need to manipulate $2^{\sqrt{\log_2n}}$, what I did was:
- $2^{\sqrt{\log_2n}}$
- $2^{\frac{1}{2}\log_2n}\impliedby$ Log property where $\log_b(n^a)=a\log_bn$
- $n^{\frac{1}{2}\log_22}\impliedby$ Log property where $a^{\log_bc}=c^{\log_ba}$
- $n^{\frac{1}{2}}\impliedby\log_22=1$
I don't know the correct answer. Moreover I know that the correct answer is smaller than $n^\frac{1}{3}$, and $n^\frac{1}{2}$is not smaller than $n^\frac{1}{3}$, so I messed up somewhere but I cannot find.
An expression like $2^{\sqrt{\log_2 n}}$ does not simplify to anything nicer.
First, the problem with the attempt in the question is that there is no rule to simplify $(\log x)^k$. We can simplify $\log(x^k)$ to $k \log x$, but there's nothing to be done when we first take the logarithm and then raise the result to a power. In particular, $\sqrt{\log_2 n} \ne \frac12 \log_2 n$. (To make this more obvious, let $y = \log_2 n$; then you are trying to simplify $\sqrt{y}$ to $\frac12 y$.)
We can make some comparisons between $2^{\sqrt{\log_2 n}}$ and other functions in terms of growth rates. More precisely: