Re: Timing of N[ Factorial[4000000], 18]
- To: mathgroup at smc.vnet.net
- Subject: [mg95686] Re: [mg95659] Timing of N[ Factorial[4000000], 18]
- From: Murray Eisenberg <murray at math.umass.edu>
- Date: Sun, 25 Jan 2009 06:49:00 -0500 (EST)
- Organization: Mathematics & Statistics, Univ. of Mass./Amherst
- References: <200901241118.GAA04803@smc.vnet.net>
- Reply-to: murray at math.umass.edu
$Version
7.0 for Microsoft Windows (32-bit) (November 10, 2008)
Timing[N[Factorial[4000000],18]]
{6.047,5.46787756151445098*10^24671065}
Ted Ersek 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
>
>
--
Murray Eisenberg murray at math.umass.edu
Mathematics & Statistics Dept.
Lederle Graduate Research Tower phone 413 549-1020 (H)
University of Massachusetts 413 545-2859 (W)
710 North Pleasant Street fax 413 545-1801
Amherst, MA 01003-9305
- References:
- Timing of N[ Factorial[4000000], 18]
- From: "Ted Ersek" <ersekt@md.metrocast.net>
- Timing of N[ Factorial[4000000], 18]