Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2009

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

Search the Archive

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

  • To: mathgroup at smc.vnet.net
  • Subject: [mg95702] Re: Timing of N[ Factorial[4000000], 18]
  • From: Scott Hemphill <hemphill at hemphills.net>
  • Date: Sun, 25 Jan 2009 06:52:01 -0500 (EST)
  • References: <gletd6$4ld$1@smc.vnet.net>
  • Reply-to: hemphill at alumni.caltech.edu

"Ted Ersek" <ersekt at md.metrocast.net> writes:

> 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.

I don't have Mathematica 7, but here's my benchmark:

In[1]:= $Version

Out[1]= 5.1 for Linux (October 25, 2004)

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

                                               24671065
Out[2]= {18.6842 Second, 5.46787756151445098 10        }

Scott
-- 
Scott Hemphill	hemphill at alumni.caltech.edu
"This isn't flying.  This is falling, with style."  -- Buzz Lightyear


  • Prev by Date: Re: Has anyone tried to use MathLink to receive real-time market data
  • Next by Date: Re: Non-deterministic numerical inaccuracies in Mathematica 7
  • Previous by thread: Re: Timing of N[ Factorial[4000000], 18]
  • Next by thread: Re: Timing of N[ Factorial[4000000], 18]