mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2010-03-10, 16:14   #144
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

186916 Posts
Default

Quote:
Originally Posted by antiroach View Post
Hey I'm new to this, but i'd like to reserve 210-212k. I'm using LLR 3.7.1c (windows). Is this the version I should be using or is there a newer version or a better program to do prp tests on these numbers? Thanks!
I'd use LLR 3.8.0--it's about 6-10% faster for these numbers. You can get it from the same place you get 3.7.1c:
http://jpenne.free.fr/index2.html
mdettweiler is offline   Reply With Quote
Old 2010-03-10, 16:15   #145
antiroach
 
antiroach's Avatar
 
Jun 2003

22×61 Posts
Default

Cool thanks, ill grab that version.
antiroach is offline   Reply With Quote
Old 2010-03-18, 13:02   #146
antiroach
 
antiroach's Avatar
 
Jun 2003

22×61 Posts
Default

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?
antiroach is offline   Reply With Quote
Old 2010-03-18, 16:41   #147
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

102538 Posts
Default

Quote:
Originally Posted by antiroach View Post
Hey after a couple of days i've found a prime:
2993*2^844644-1 is prime! Time : 1625.153 sec.
Congratulations! I see you've already submitted it to the Top 5000 list, but there's a problem with how you credited it. You credited LLR, but not CRUS and srsieve, as this page instructs you to:
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.
Quote:
Originally Posted by antiroach View Post
Does this mean i can remove all remaining entries with k=2993 in the remainder of the file that i'm prp'ing?
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.
Mini-Geek is offline   Reply With Quote
Old 2010-03-18, 16:53   #148
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

1011001001002 Posts
Default

Quote:
Hey after a couple of days i've found a prime:
2993*2^844644-1 is prime! Time : 1625.153 sec.
Nice one.

That leaves just 25k's to go.
MyDogBuster is offline   Reply With Quote
Old 2010-03-18, 16:57   #149
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

186916 Posts
Default

Quote:
Originally Posted by antiroach View Post
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?
Yep, you got it. However, for ranges like this where the primes are in top-5000 territory, and you're using LLR for testing (which doesn't remove k's automatically in this type of situation like PFGW does--we use PFGW for other drives for this reason but it's not ideal for base 16 because it produces incompatible residues), some people prefer to just leave such k's in until the end of the range, especially if they're not far from the end. The idea is that they might just pick up a "bonus" prime on that same k farther along in the range (which is not particularly useful for CRUS, but still interesting as a curiosity). In fact that happened to Gary once a while back--he found a prime, left in the k, and found another prime on it afterwards.

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
mdettweiler is offline   Reply With Quote
Old 2010-03-18, 17:05   #150
antiroach
 
antiroach's Avatar
 
Jun 2003

22·61 Posts
Default

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
antiroach is offline   Reply With Quote
Old 2010-03-18, 17:24   #151
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

28A316 Posts
Default

Quote:
Originally Posted by antiroach View Post
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
Congrats on a quick and large prime!

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
gd_barnes is online now   Reply With Quote
Old 2010-03-18, 17:28   #152
gd_barnes
 
gd_barnes's Avatar
 
May 2007
Kansas; USA

101×103 Posts
Default

Quote:
Originally Posted by MyDogBuster View Post
Nice one.

That leaves just 25k's to go.
This is the Riesel side so it leaves 22 k's remaining. There are 26 k's remaining on the Sierp side.
gd_barnes is online now   Reply With Quote
Old 2010-03-18, 18:22   #153
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

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.
mdettweiler is offline   Reply With Quote
Old 2010-03-18, 18:47   #154
MyDogBuster
 
MyDogBuster's Avatar
 
May 2008
Wilmington, DE

22×23×31 Posts
Default

Quote:
This is the Riesel side so it leaves 22 k's remaining. There are 26 k's remaining on the Sierp side.
That cinches it. Time for new glasses, or maybe I should just wear the ones I'm supposed to wear. LOL
MyDogBuster is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 10:33.


Tue Jul 27 10:33:07 UTC 2021 up 4 days, 5:02, 0 users, load averages: 2.66, 2.09, 1.95

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.