On Tue, May 5, 2009 at 11:49 AM, William Stein <wst...@gmail.com> wrote:
> On Tue, May 5, 2009 at 11:43 AM, VictorMiller <victorsmil...@gmail.com> wrote:
>>
>> As a comparison I just ran my old C program (implementing the
>> algorithm in my paper with Lagarias and Odlyzko) on my workstation
>> which is a fast Dell '86 box (sorry I don't have more details) running
>> Red Hat:
>
> Wow, I didn't know Dell was selling computers back in 1986. :-) [just
> kiddin']
>
>>
>> time ./findn 249999999999999
>> n=249_999_999_999_999
>> pi(249_999_999_999_999)=7_783_516_108_362
>>
>> real 0m18.826s
>> user 0m18.628s
>> sys 0m0.028s
>
> Wow, nice! Give my your C code!!
>
By the way, on a core2 2.66Ghz 13MB cache (sage.math) we have:
In[3]:= Timing[PrimePi[249999999999999]]
Out[3]= {155.44, 7783516108362}
So your timings above are significantly better than all general
purpose math software for
computing prime_pi.
William
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
