Re: Timing of N[ Factorial[4000000], 18]
- To: mathgroup at smc.vnet.net
- Subject: [mg95707] Re: Timing of N[ Factorial[4000000], 18]
- From: Jean-Marc Gulliet <jeanmarc.gulliet at gmail.com>
- Date: Sun, 25 Jan 2009 06:52:58 -0500 (EST)
- Organization: The Open University, Milton Keynes, UK
- References: <gletd6$4ld$1@smc.vnet.net>
In article <gletd6$4ld$1 at smc.vnet.net>,
"Ted Ersek" <ersekt at md.metrocast.net> wrote:
> 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]:= N[Factorial[4000000], 18] // Timing
Out[1]= {18.532, 5.46787756151445098*10^24671065}
Mathematica 7.0.0 32-bit Windows XP Pro SP3 (MathematicaMark7: 0.41)
Regards,
--Jean-Marc