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

MathGroup Archive 2009

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

Search the Archive

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

  • To: mathgroup at smc.vnet.net
  • Subject: [mg95728] Re: [mg95686] Re: [mg95659] Timing of N[ Factorial[4000000], 18]
  • From: peter <plindsay.0 at gmail.com>
  • Date: Sun, 25 Jan 2009 21:48:51 -0500 (EST)
  • References: <200901241118.GAA04803@smc.vnet.net>

$Version
7.0 for Mac OS X x86 (64-bit) (November 11, 2008)

 Timing[N[Factorial[4000000],18]]
 {3.49545,5.46787756151445098*10^24671065}

Peter

2009/1/25 Murray Eisenberg <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
>
>


  • Prev by Date: Re: iterative method?
  • Next by Date: Re: NestList
  • Previous by thread: Re: Timing of N[ Factorial[4000000], 18]
  • Next by thread: Re: Re: Timing of N[ Factorial[4000000], 18]