Register

Mid exam

1,012 views
0 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.

1 Answer

Best answer
0 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
Voting & Accepting an answer helps improve the community
← Previous · gate dummy questionNext → · gate 2019
← Previous in category · General doubtNext in category → · finding two positive...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
611
611 views
go_editor asked Sep 15, 2018
611 views
ISI2017-MMA-7
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...
0 0 votes
1 answers 1 answer
1.3k
1.3k views
Balaji Jegan asked Jun 3, 2018
1,334 views
Mind Boggling question
4 4 votes
0 0 answers
1.2k
1.2k views
Balaji Jegan asked Jan 26, 2018
1,174 views
Test Series
The unit digit of the following expression$(1!)^{99!} + (2!)^{98!} + (3!)^{97!} + (4!)^{96!} +\dots + (99!)^{1!}$
0 0 votes
0 0 answers
367
367 views
Misbah Ghaya asked Aug 26, 2022
367 views
Best Open Video Playlist for Logarithms Topic | Quantitative Aptitude
Please list out the best free available video playlist for Logarithms from Quantitative Aptitude as an answer here (only one playlist per answer). We'll then select the b...