Services & ResourcesWolfram ForumsMathGroup Archive

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

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

• To: mathgroup at smc.vnet.net
• Subject: [mg95689] Re: [mg95659] Timing of N[ Factorial[4000000], 18]
• From: Robert Pigeon <robert.pigeon at videotron.ca>
• Date: Sun, 25 Jan 2009 06:49:34 -0500 (EST)
• References: <200901241118.GAA04803@smc.vnet.net>

$Version
"7.0 for Microsoft Windows (32-bit) (November 10, 2008)"


{7.55, 5.46787756151445098*10^24671065}

Robert

-----Original Message-----
From: Ted Ersek [mailto:ersekt at md.metrocast.net] 
Sent: 24 janvier 2009 06:18
To: mathgroup at smc.vnet.net
Subject: [mg95689] [mg95659] Timing of N[ Factorial[4000000], 18]

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

• References:
  • Timing of N[ Factorial[4000000], 18]
    • From: "Ted Ersek" <ersekt@md.metrocast.net>