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

Re: Timing of N[ Factorial[4000000], 18]

• To: mathgroup at smc.vnet.net
• Subject: [mg95725] Re: Timing of N[ Factorial[4000000], 18]
• From: "sv07171024" <steven_504 at telenet.be>
• Date: Sun, 25 Jan 2009 21:48:19 -0500 (EST)
• References: <gletd6$4ld$1@smc.vnet.net>

"Ted Ersek" <ersekt at md.metrocast.net> wrote in message 
news:gletd6$4ld$1 at smc.vnet.net...
> 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.
>

In[1]:= Timing[N[Factorial[4000000], 18]]

Out[1]= {7.515, 5.46787756151445098*10^24671065}


Win XP SP3 on AMD Phenom 9500 @ 2.2GHz