Register

Mid exam

460 views
0 votes
0 votes
Hi everyone!

I've been recently asked by one of my friends to prove an equation but still, I'm confused how to get it started tho.

log(n!) = Ω(nlog(n))

Does anyone know how to help?
I'll be very grateful if someone comes to reply to my issue.

Thanks in advance.
User Avatar

1 Answer

Best answer
0 votes
0 votes
n! can be written as n(n-1)(n-2).....1.

$n! = n(n-1)(n-2)...1.$

Highest order term in the product is $n^{n}$.

In time complexity , the lower order terms do not contribute.

Thus , $n! = \Omega(n^{n}) => log(n!) = \Omega(log(n^{n})) = \Omega(nlog(n))$

More formally , $log(n!) = \Theta(nlog(n))$
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Sep 15, 2018
317 views
ISI2017-MMA-7
Let $n \geq 3$ be an integer. Then the statement $(n!)^{1/n} \leq \dfrac{n+1}{2}$ is true for every $n \geq 3$ true if and only if $n \geq 5$ not true for $n \geq 10$ true for even integers $n \geq 6$, not true for odd $n \geq 5$
Let $n \geq 3$ be an integer. Then the statement $(n!)^{1/n} \leq \dfrac{n+1}{2}$ istrue for every $n \geq 3$true if and only if $n \geq 5$not true for $n \geq 10$true fo...
User Avatar
0 votes
0 votes
1 answer
2
Balaji Jegan asked Jun 3, 2018
759 views
Mind Boggling question
User Avatar
3 votes
3 votes
0 answers
3
Balaji Jegan asked Jan 26, 2018
462 views
Test Series
User Avatar
0 votes
0 votes
0 answers
4
Pranav Madhani asked Dec 24, 2017
304 views
General Question
How can i learn to solve questions based on impllications , contrapositive, conjuction etc maths proportional logic? I am not able to solve any single question of that topic. How can i learn?
How can i learn to solve questions based on impllications , contrapositive, conjuction etc maths proportional logic? I am not able to solve any single question of that ...
User Avatar
Link Copied!