# Cormen Edition 3 Exercise 3.2 Question 3 (Page No. 60)

43 views
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.

n! = omega(2^n)

n! = n * (n-1) * (n-2) * .......2 * 1     >      2 * 2 * 2* 2*  ...... * 2 (n times)          ; n > 2, (n-1) > 2 , (n-3) >2

so, n! =  omega(2^n)

n! = n * (n-1) * (n-2) * .......2 * 1    <     n * n * n *n         *n   (n times)           ; n = n , n-1 <n ; n-2 <n ; n-3 < n

so , n! = big-O( n^n)

## Related questions

1
34 views
Show that $K$ $ln$ $K = \Theta (n)$ implies $k=$\Theta$($n$/$lnn$)$.
Show that the golden ratio $\phi$ and its conjugate $\hat{\phi}$ both satisfy the equation $x^2=x+1$.
Which is asymptotically larger: $lg(lg^*n)$ and $lg^*(lg n)$ ?
Is the function $\lceil$ $lg$ $n$ $\rceil$!$polynomially bounded ? Is the function$\lceillglgn\rceil$!$ polynomially bounded ?