On Sep 16, 2009, at 12:10 PM, Fredrik Johansson wrote:
> On Wed, Sep 16, 2009 at 8:56 PM, William Stein <wst...@gmail.com>
> wrote:
>
>> * Kevin Steuve: Compressing tables of differences between Li(x) and
>> pi(x) by looking at differences of errors. Using lza only save
>> 1/8 th
>> disk space (thought we would get more). Also made my code use
>> multi-core above $10^{12}$. Today: working on $n$th prime function
>> using Victor Miller's linear interpolation method.
>
> Just a random thought: would it be advantageous to use the Riemann
> prime counting function instead of Li(x)?
I know he's looked into this--it's unclear how much of a savings it
would be (I'll let him say more).
- Robert
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
