Re: Timing of N[ Factorial[4000000], 18]
- To: mathgroup at smc.vnet.net
- Subject: [mg95688] Re: [mg95659] Timing of N[ Factorial[4000000], 18]
- From: Bob Hanlon <hanlonr at cox.net>
- Date: Sun, 25 Jan 2009 06:49:22 -0500 (EST)
- Reply-to: hanlonr at cox.net
About 5 sec on an iMac with 2.33 GHz Intel Core 2 Duo
$Version
"7.0 for Mac OS X x86 (64-bit) (November 11, 2008)"
Timing[N[Factorial[4000000], 18]]
{4.844104999999956,
5.4678775615144509794160360\
7630299100641970199064388473`18.*^24671065}
Bob Hanlon
---- 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.
------------------------
Thanks,
Ted Ersek