News for hackers. Stuff that matters.

A comment on Naive Parallel Prime Numbers Sieve in Erlang. Parent comment

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 ]