Naive Parallel Prime Numbers Sieve in Erlang

Re:Naive Parallel Prime Numbers Sieve in Erlang by old_sound on Monday February 17, 2014 @11:18AM (#7252733)

I haven't checked your code. My point is that this sieve is not fast, or "better" than any previous sieves. The only thing I've found interesting is that I haven't found the method in some other number theory books, like Hardy's, or on the internet, and so on.

That is, I wouldn't be surprised if there are better sieving methods out there.

[ Parent | on HN ]

Re:Naive Parallel Prime Numbers Sieve in Erlang by pavanky on Monday February 17, 2014 @11:22AM (#7252752)

I understand. I was just checking for my own curiosity. May be there is no literature on this because the 6k method is very widely known and seems to be quite a bit faster.

There may be minor tweaks to your algorithm that can make it significantly faster. I'll let you know if I can think of anything :)

[ Parent | on HN ]

Re:Naive Parallel Prime Numbers Sieve in Erlang by old_sound on Monday February 17, 2014 @11:30AM (#7252791)

Cool. The thing is I arrived to this method by checking some Permutation Groups for something completely tangential, but again, Number Theory is so vast this probably exists somewhere :)

About speed ups, I'm happy to accept pull requests, even if you want to do it in Python. The Erlang bits are just because I wanted to play with the concepts from "chemical programming"

[ Parent | on HN ]