371 views
1 1 vote

Let $f(n) := 2^n, g(n) := n$ and $h(n) :=$ $n^{log n}$. Which of the following statements is true$?$

  1. log $h(n) = O(g(n))$ and log $h(n) = \Omega$(log $f(n)).$
  2. $f(n)= O(g(n))$ and $f(n)= O(h(n))$.
  3. $g(n) = \Theta$(log $f(n))$ and $h(n) = O(f(n))$.
  4. log $f(n) = O(g(n))$ and log $f(n) = O$(log $h(n)).$

1 Answer

5 5 votes
\(f(n)=2^n\), \(g(n)=n\), and \(h(n)=n^{\log n}\).

\[
\log f(n)
= \log\bigl(2^n\bigr)
= n\cdot\log 2
= \Theta(n).
\]

Also,
\[
\log h(n)
= \log\bigl(n^{\log n}\bigr)
= (\log n)^2.
\]

Therefore,
\[
g(n)
= n
= \Theta\bigl(\log f(n)\bigr).
\]

For \(h(n)\):
\[
\log_2 h(n)
= \log_2\bigl(n^{\log_2 n}\bigr)
= \log_2 n \cdot \log_2 n
= (\log_2 n)^2.
\]

For \(f(n) = 2^n\):
\[
\log_2 f(n)
= \log_2(2^n)
= n.
\]

 

Since for large \(n\), \((\log_2 n)^2 \ll n\),we get:
\[
 \quad h(n) = O(2^n).
\]
\[
\boxed{\text{Option C is correct.}}
\]
 
Position:
Show:

Related questions

2 2 votes
3 3 answers
489
489 views
Random Oracle asked Jul 2, 2025
489 views
What is the correct asymptotic of $\sum^{n}_{i=1} \dfrac {n}{i^2}?$$\Theta(n)$$\Theta(n$ log $n)$$\Theta(1)$$\Theta(n^2)$
1 1 vote
2 2 answers
327
327 views
Random Oracle asked Jul 3, 2025
327 views
Let $S = \sum_{n\geq1} \dfrac{1}{n^2}$ and $A = \sum_{n\geq1}(-1)^{n+1}\dfrac{1}{n^2}$. Then which of the following statements is true?$S$ converges but $A$ does not conv...
0 0 votes
1 1 answer
277
277 views
Random Oracle asked Jul 3, 2025
277 views
Let $a, b$ and $c$ denote regular expressions. Which of the following is an identity$?$None of the choices$a . (b + c) = (b + c) . a$$$c^* . a^* . b^* = c^* . b^* . a^*$$...
3 3 votes
1 1 answer
397
397 views
Random Oracle asked Jul 2, 2025
397 views
Consider $n$ points equi-separated on a circle of radius one.Fix one of the points, and consider the product of the lengths of the chord from this point to all the other ...