Thread: no twin left behind? View Single Post
2011-01-18, 18:18   #32
Mini-Geek
Account Deleted

"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts

Quote:
 Originally Posted by henryzz If you give in before 5789*2^15513+1, +3 then I would do it. This one is worth testing because it is the largest we know of in its class.
Ok, I'll leave that one to you. I am also not proving 7027*2^13017-3 and 755*2^13474-3. You or anyone else can do those, or they could stay just PRPs for a while (until someone wants to prove them).
For clarity, here are the largest PRPs I found and who has them reserved for proving:
Code:
517*2^6098+3 and below Mini-Geek (done, certificates in DB)
7315*2^6423-3 Mini-Geek (done, certificate in DB)
1381*2^6512+3 Mini-Geek (done, certificate in DB)
7027*2^13017-3 [unreserved]
755*2^13474-3 [unreserved]
5789*2^15513+3 henryzz
The first 1767 (all before 517*2^6098+3) took about 19 hours. The last one I completed, 517*2^6098+3, took a little over 5 hours. I'd guess the next two I'm doing are 6-8 hours each and the largest three are several days to a few weeks each (unless you do multicore Primo or a distributed ECPP).
Also, a status on my PRPing:
I have split it into 3 parts and am running it on Prime95, (multiple cores and automatic P-1 makes it much better than PFGW when the numbers are this size ) the lowest is at n=819630, and there are 29 candidates left to PRP. The largest one alone will probably take a couple days, since it is so large: 2^13466917-3. If that turns out PRP, that would be incredible! Besides being the largest PRP, with 4053946 digits, it would (probably) be a twin with a Mersenne prime. Unfortunately that is extremely unlikely...

Last fiddled with by gd_barnes on 2011-01-21 at 09:05 Reason: update completion status