Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this community
This question already has an answer here:
Is that statement false or true? I believe it's false because ln(n) = log base e of n. So therefore, log base 2 of n can be a minimum because in 2^x = n, x will always be less than y in e^y = n. However can it ever be proven that log base 2 of n can be a maximum?
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
Remember your log laws:
$$ \log_{a}b = \frac{log_{x}b}{\log_{x}a} $$
So $$ \ln n = \frac{\log_{2}n}{\log_{2}e} $$
Given this, can you think of three constants $c_{1}$, $c_{2}$ and $n_{0}$ such that $\ln n \leq c_{1}\cdot\log_{2} n$ and $\ln n \geq c_{2}\cdot \log_{2}n$ for all $n \geq n_{0}$?
