![]() |
|
|
#144 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
186916 Posts |
Quote:
http://jpenne.free.fr/index2.html |
|
|
|
|
|
|
#145 |
|
Jun 2003
22×61 Posts |
Cool thanks, ill grab that version.
|
|
|
|
|
|
#146 |
|
Jun 2003
22×61 Posts |
Hey after a couple of days i've found a prime:
2993*2^844644-1 is prime! Time : 1625.153 sec. Does this mean i can remove all remaining entries with k=2993 in the remainder of the file that i'm prp'ing? |
|
|
|
|
|
#147 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
102538 Posts |
Quote:
http://www.mersenneforum.org/showthread.php?t=9782 I think that to fix it, you'll have to email caldwell@utm.edu informing him of the needed change. Correct. All larger candidates with that k do not need to be tested. You can remove them from the file to save time, or you can leave them in the file to avoid the trouble of removing it and have an ever-so-slightly higher chance of finding another huge prime in your range. Up to you. |
|
|
|
|
|
|
#148 | |
|
May 2008
Wilmington, DE
1011001001002 Posts |
Quote:
![]() That leaves just 25k's to go. |
|
|
|
|
|
|
#149 | |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
186916 Posts |
Quote:
But, it's your call. I personally prefer to remove such k's most of the time since I've always been one to "pinch CPU cycles", but sometimes will leave them in if it's too much hassle. Either way is fine as far as the project goes. ![]() BTW, speaking of this prime: did you report it to the top-5000 list website? If you're not familiar with the process, someone here can give instructions. (If you've done this before, the proof code you'd need to use is "[your name], CRUS, LLR, Srsieve".) Edit: Ah, I see Mini-Geek beat me to the punch while I was writing this post.
Last fiddled with by mdettweiler on 2010-03-18 at 16:58 |
|
|
|
|
|
|
#150 |
|
Jun 2003
22·61 Posts |
Thanks for the info guys. I've emailed Chris Caldwell and requested he modify the proof-code accordingly.
I've also removed the other entries with k=2993 to speed up the conjecture proving process :0 Last fiddled with by antiroach on 2010-03-18 at 17:05 |
|
|
|
|
|
#151 | |
|
May 2007
Kansas; USA
28A316 Posts |
Quote:
![]() Prof. Caldwell will probably ask you to create a new proof code yourself that credits the correct project/software. He'll then transfer the prime over to it. After the transfer, the incorrect proof code will then "delete itself" after more than 24 hours without any reported primes. Last fiddled with by gd_barnes on 2010-03-18 at 17:30 |
|
|
|
|
|
|
#152 |
|
May 2007
Kansas; USA
101×103 Posts |
|
|
|
|
|
|
#153 |
|
A Sunny Moo
Aug 2007
USA (GMT-5)
3·2,083 Posts |
You know, I've gotta say...with all these primes we've been having lately on the bases 16, the huge primeless gaps in both of them (~140K-195K on the Sierp. side, and ~100K-200K with sporadic exceptions on the Riesel side) are looking more and more suspect. I'm beginning to wonder if some doublechecking isn't in order. With newer, faster machines more widely disseminated now, I imagine we could get through those respective ranges in reasonably short order if we had a total of 2-4 quads working on them.
Any thoughts on this? I think there's a reasonably decent chance of finding an additional prime or two on one or both of these drives. Much of the primeless gaps were done in rather large contiguous chunks by a few people, enough so that just one bad machine could have caused a lot of damage. |
|
|
|
|
|
#154 | |
|
May 2008
Wilmington, DE
22×23×31 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Riesel base 6 - team drive #4 - EIGHT OR BUST! | gd_barnes | Conjectures 'R Us | 401 | 2015-05-27 15:15 |
| Sierp base 63 - team drive #5 | rogue | Conjectures 'R Us | 146 | 2011-04-20 05:12 |
| Sieving drive Riesel base 6 n=1M-2M | gd_barnes | Conjectures 'R Us | 40 | 2011-01-22 08:10 |
| Sieving drive Riesel base 6 n=150K-1M | gd_barnes | Conjectures 'R Us | 27 | 2009-10-08 21:49 |
| Riesel base 3 - mini-drive I | gd_barnes | Conjectures 'R Us | 199 | 2009-09-30 18:44 |