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
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 immense insight
> into areas of mathematics as diverse as ar
Because I have worked with prime counting and Sage, my input belongs
in this discussion.
For the record, there are three families of prime counting algorithms-
combinatorial, analytical, and table-based.
The combinatorial family includes Legendre's formula as well as the
Meissel-Lehmer-Lagarias-M
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 11/7/10 4:03 AM, David Kirkby wrote:
On 5 November 2010 18:48, nekopczynski wrote:
Hello Everyone,
I am currently a senior computer science student with a strong math
background. One of my professors, Dana Ernst, also a member here,
recommended that I post here. I am looking for a senior p
On Nov 7, 1:24 am, David Kirkby wrote:
> 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 the nearest hou
On Nov 6, 8:37 pm, William Stein wrote:
> > I'm not sure if the student asking was an undergrad or postgrad. We tend to
> > use the terms different here in the UK to the US.
>
> > The original poster said:
>
> > "I am currently a senior computer science student with a strong math
> > background.
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 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 the central role that the Riemann Hypothesis (wh
On 11/6/10 8:37 PM, William Stein wrote:
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 cent
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
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 are approaching parallelism.
Here's a place you can
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
Having talked to Nathan briefly, I think that he may be interested in
potentially improving already existing algorithms. This is a bit
beyond my scope of knowledge, so I suggested that he contact this
list.
On Nov 5, 2:48 pm, nekopczynski wrote:
> Hello Everyone,
> I am currently a senior comput
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.
If that's what you are referring to, then yeah I guess you could get a
project out of that if it hasn't already been done. If you were a
strong p
19 matches
Mail list logo
