On Sat, Nov 20, 2010 at 9:51 PM, rjf wrote:
>
>
> On Nov 20, 4:49 pm, kstueve wrote:
>
>>
>> One of the reasons making the fastest possible pi(x) available is
>> important is because of its relationship to the Riemann hypothesis. A
>> proof of the Riemann hypothesis would not only provide immens
Well, I'm a couple days late to the conversation, but a couple comments:
If Nathan doesn't have a background knowledge in math, then I think prime
counting/enumeration are very good projects, especially if he wants to look
at parallizable algorithms. The current prime_pi in sage was my first real
On Saturday 06 November 2010, rjf wrote:
> Why not look around at the state of the art
> in using computers to do something that might be of some benefit.
> Math doesn't have to be useless.
>
> You can look at what other people, especially computer scientists,
> have been trying to do and how they
On 7 November 2010 09:22, David Kirkby wrote:
> As a matter of interest, have many hours have spent using Sage?
Oops, that was supposed to say:
"As a matter of interest, how many hours have you spent using Sage?"
Dave
--
To post to this group, send an email to sage-devel@googlegroups.com
To
On 7 November 2010 03:51, rjf wrote:
>
>
> On Nov 6, 5:06 pm, "Dr. David Kirkby" wrote:
>> On 11/ 6/10 10:25 PM, William Stein wrote:
>>
>> > I think it would be wonderful to have a fast implementation of
>> > computing the number primes up to x, which is freely available,
>> > especially given t
On Sat, Nov 6, 2010 at 5:06 PM, Dr. David Kirkby
wrote:
> On 11/ 6/10 10:25 PM, William Stein wrote:
>
>> I think it would be wonderful to have a fast implementation of
>> computing the number primes up to x, which is freely available,
>> especially given the central role that the Riemann Hypothes
On 11/ 6/10 10:25 PM, William Stein wrote:
I think it would be wonderful to have a fast implementation of
computing the number primes up to x, which is freely available,
especially given the central role that the Riemann Hypothesis (which
is a statement about pi(x)) has in mathematics. It's sad
On Sat, Nov 6, 2010 at 11:05 AM, David Kirkby wrote:
> On 6 November 2010 10:37, Bill Hart wrote:
>> David, do you mean compute prime_pi up to some huge bound (by doing
>> sieving in parallel), then make a giant table with "waypoints" which
>> Sage refers to.
>
> The magic code apepars to be the
On 6 November 2010 10:37, Bill Hart wrote:
> David, do you mean compute prime_pi up to some huge bound (by doing
> sieving in parallel), then make a giant table with "waypoints" which
> Sage refers to.
The magic code apepars to be the
"Meissel-Lehmer-Lagarias-Miller-Odlyzko algorithm"
, which I t
