Question #85285
Prove that n + log2n = O(n) by showing that there exists a constant c > 0 such that n + log2n ≤ cn.
(note that log2n means (log n)2.)
1
Expert's answer
2019-02-22T05:38:07-0500
(log2nn)=2logn×1/n1=2((lognn))/n0,nN(\log^2⁡n-n)'=2 \log ⁡n \times 1/n-1=2 ((\log ⁡n-n))/n\le0,\quad n\in\mathbb{N}(lognn)=1/n10(\log ⁡n-n)'=1/n-1\le0log2nn\log^2 n \le nn+log2nn+n=2n,nNn + \log^2 n \le n + n = 2n,\quad n\in \mathbb{N}

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS