Sieving
 

I am new here and was just wondering: Aren't you guys doing the same sieving stuff as projects like [url]www.seventeenorbust.com[/url] (their sub-project about sieving) and [url]www.rieselsieve.com?[/url]

Are the three of you sieving the same ranges or have you picked some each?

Or am I just getting it all wrong?

It is the same kind of work and the same program to do - but every project tests different numbers:

SoB: Proth numbers (k*2^n+1) with k < 78,557
RieselSieve: Riesel numbers (k*2^n-1) with k < IDon'tKnowAtTheMoment
PSP: Proth numbers with [b]prime[/b] k's (prime k's < 78,557 won't get checked again, of course)

Ahh... I see :smile:

How does the work give divided up by the different projects, or does it?

Each project is working on disjunct candidates, so there is no need to divide work.

An exception can be seen in the prime k's of (potential) proth numbers < 78,557. These are necessary for PSP and SoB. But SoB was already way ahead when PSP was founded, so PSP stays away from these candidates and cheers everytime a SoB prime is of a prime k. :wink: