mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2004-12-28, 04:24   #111
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

E2616 Posts
Default

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 ...
Kosmaj is offline   Reply With Quote
Old 2004-12-28, 10:47   #112
em99010pepe
 
em99010pepe's Avatar
 
Sep 2004

2·5·283 Posts
Default

Quote:
Originally Posted by 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 ...
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
em99010pepe is offline   Reply With Quote
Old 2004-12-30, 18:57   #113
lsoule
 
lsoule's Avatar
 
Nov 2004
California

6A816 Posts
Default

504to508 complete, no primes
lsoule is offline   Reply With Quote
Old 2004-12-31, 13:36   #114
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

292 Posts
Default

Quote:
Originally Posted by Kosmaj
CedricVonck
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!
By the way, I am crunching over about a year for RieselSieve & Sob.
I recently found 2 primes myself in the PrimeSearch project

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.

Last fiddled with by ValerieVonck on 2004-12-31 at 13:38
ValerieVonck is offline   Reply With Quote
Old 2004-12-31, 16:22   #115
lsoule
 
lsoule's Avatar
 
Nov 2004
California

23·3·71 Posts
Default

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.

Happy New Year
lsoule is offline   Reply With Quote
Old 2005-01-02, 09:16   #116
lsoule
 
lsoule's Avatar
 
Nov 2004
California

110101010002 Posts
Default

524to528 and 528to532 complete, no primes.

Reserving 536to540
lsoule is offline   Reply With Quote
Old 2005-01-05, 17:24   #117
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

292 Posts
Default

Code:
520,000 - 524,000 - CedricVonck- In Progress
85% done.
ValerieVonck is offline   Reply With Quote
Old 2005-01-05, 17:30   #118
lsoule
 
lsoule's Avatar
 
Nov 2004
California

170410 Posts
Default

536-540 complete, no primes

Reserving 540-544.
lsoule is offline   Reply With Quote
Old 2005-01-06, 08:08   #119
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2·1,811 Posts
Default

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

CedricVonck
Just keep on going! 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?)
Kosmaj is offline   Reply With Quote
Old 2005-01-06, 14:37   #120
masser
 
masser's Avatar
 
Jul 2003
wear a mask

22·419 Posts
Default 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 is offline   Reply With Quote
Old 2005-01-06, 16:12   #121
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

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.
Attached Files
File Type: txt riesel.txt (880 Bytes, 99 views)

Last fiddled with by Kosmaj on 2005-01-06 at 16:43
Kosmaj is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Choose your own K and work on finding a top-5000 prime! lsoule Riesel Prime Search 421 2021-07-27 23:51
Test a Specific Exponent in Prime95. When it is 100% done, does it mean I find a new prime number? king Information & Answers 5 2018-02-21 18:15
If you find a prime... paulunderwood NeRDs 0 2014-02-03 05:09
Help test 210885 - Find a new top 5000 prime! SlashDude Riesel Prime Search 121 2008-01-03 08:47
The fastest way to a top-5000 prime? lsoule 15k Search 13 2005-09-19 20:24

All times are UTC. The time now is 11:12.


Mon Aug 2 11:12:42 UTC 2021 up 10 days, 5:41, 0 users, load averages: 0.76, 1.11, 1.34

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.