MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: How can I prove by induction: log n!=O(n log n)

  • To: mathgroup at smc.vnet.net
  • Subject: [mg27865] Re: How can I prove by induction: log n!=O(n log n)
  • From: "The Majestic Moined Mogul" <rporter45 at home.com>
  • Date: Thu, 22 Mar 2001 04:30:06 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

Could someone please expand on this a little more and maybe prove by
induction.

Hello,

> Could someone please assist me with this mathematical proof:
>
> log n! = O (n log n)

log n! = log ( n * ( n - 1 ) * ... * 1 ) = log n + log( n-1 ) + ... +
log 1 <= c * n * log n
=> log n! = O (n log n)






  • Prev by Date: Random number generation
  • Next by Date: Q: DeleteCases
  • Previous by thread: Re: Random number generation
  • Next by thread: Q: DeleteCases