Guys, I'll tell you more about sieving soon. But pepe (if I can call you so) you haven't worked with us on this k until now, do you really want just to sieve or you plan to join us later (?)

Now reserving 532to536 ...

[QUOTE=Kosmaj]Guys, I'll tell you more about sieving soon. But pepe (if I can call you so) you haven't worked with us on this k until now, do you really want just to sieve or you plan to join us later (?)

Now reserving 532to536 ...[/QUOTE]

Kosmaj,

I am working on a 321 range, one day to go. Then I will finish my PSP sieve range then I would like to try something new, sieve here a range for a week or so.

And call me Carlos.

Carlos

504to508 complete, no primes

[QUOTE=Kosmaj][B]CedricVonck[/B]
Welcome to the group! I'm not sure how familiar you are with prime number search and how many have you found so far, I noticed you searched for some "prime Seirpinski" numbers, in any case if you have any questions don't hesitate to ask. Just remember two things, (1) if you find a prime please include in your prover's code "15k" search, and (2) mail me the results file when you are done. You can find the details in the first post of the thread.

BTW, I reconstructed the file with all candidates to n=1M sieved to 3250 bn. There are quite a few candidates (about 155 per 1000) remaining and if we go on with testing I suggest we do some more sieveing, to 4000 or 5000 bn. We can arrange the details early in January. Are there any volunteers? It's the best to sieve using "ksieve" on a fast Athlon or on 1GHz or faster P-3 letting P-4's run LLR.

Merry Christmas![/QUOTE]

By the way, I am crunching over about a year for RieselSieve & Sob.
I recently found 2 primes myself in the PrimeSearch project :geek: :geek:

But the were too small for the top 500 (or 5000) list.

For the sieve, can we not use Proth Sieve?

Thanx & Merry Christmas & Happy New Year.

This is a good place to find a top 5000 prime. I joined 15k about
2 months ago and I've already added 15 primes to the top 5000.
The next prime found by the group 2995125705 search should be in
the top 250. :banana:

Happy New Year

524to528 and 528to532 complete, no primes.

Reserving 536to540

[CODE]520,000 - 524,000 - CedricVonck- In Progress [/CODE]

85% done.

536-540 complete, no primes

Reserving 540-544.

532to536 done to 535820, only 30 more to go, no primes.
Reserving 544-548.

[B]CedricVonck[/B]
Just keep on going! :cool: We had several first-time crunchers who couldn't complete their first assignment. I'm glad you are not among them.

As for ProthSieve, last time I heard it couldn't handle k's divisible by 3 (and/or 5?)

prothsieve
 

Hi all,

proth_sieve works fine for small k's divisible by 3 and 5. I've used it for sieving k=111, 123, 153, 159, 171, 183, 189, 219 and 225, all of which are divisible by 3 and one of them is divisible by 5.

regards,
masser

masser,
Thanks for the info.
I just tried it but it seems it cannot handle such a large k. With k=2995125705 it crashes. If I remove last "05" and set k=29951257 it runs OK. I'm enclosing the file riesel.txt with first 200 values if anybody wants to try. Rename it to riesel.dat before running.

It also appears too slow to sieve a single k. Either that or the range of 560k-1M is too narrow.

BTW, how do you start from scratch, for example if one wants to sieve k=5, 7, and 9 from n=1M to n=2M, p=3 to 1bn what does he do? Assuming he has no pre-sieved values.