MathGroup Archive: January 2009 [00430]

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

Timing of N[ Factorial[4000000], 18]

To: mathgroup at smc.vnet.net
Subject: [mg95659] Timing of N[ Factorial[4000000], 18]
From: "Ted Ersek" <ersekt at md.metrocast.net>
Date: Sat, 24 Jan 2009 06:18:27 -0500 (EST)

How long does it take Mathematica 7 to compute
   N[ Factorial[4000000], 18]

With the old version of Mathematica I have it takes a very long time, 
and I was wondering if Mathematica 7 is much better.  You might ask why 
I wanted to do that.  Well I wanted to see how quickly Stirling's 
formula approaches  Factorial[n]  for large n.

------------------------
Thanks,
     Ted Ersek

Follow-Ups:
- Re: Re: Timing of N[ Factorial[4000000], 18]
  - From: peter <plindsay.0@gmail.com>
- Re: Timing of N[ Factorial[4000000], 18]
  - From: Murray Eisenberg <murray@math.umass.edu>
- Re: Timing of N[ Factorial[4000000], 18]
  - From: Robert Pigeon <robert.pigeon@videotron.ca>

Prev by Date: Re: Basic questions on list manipulation in the

Next by Date: ?1/2

Previous by thread: Re: Dynamic, UpdateInterval and global variable

Next by thread: Re: Timing of N[ Factorial[4000000], 18]