20090408, 05:19  #23  
May 2007
Kansas; USA
276A_{16} Posts 
Quote:
My suggestion would be to take a group of Riesel primes where k's are divisible by 3 and sieve them using srsieve for the Proth form up to some low limit. Usually the sieve will eliminate either all of them or all but a few of them. To avoid redundant checking, for anything k<1200, stick to n>260K because I've already checked up to n=260K. For higher k's, which our 8th/9th/10th drives have plenty of primes for now, you could start at n=48K. That is as high as I've gotten in my testing of all k<1M. Come to think of it, an excellent starting point would be the n=50K200K portion of our 9th drive. 80% of the k's are > 1200 and all n are > 48K. That would be by far the most effective place to start because we already have the primes sorted nicely by kvalue. After that, continuing with the n=200K350K portion of that drive would be good because all k's are > 1200. There you go! Any twin for n>~80K makes the top20 list at top5000 and is reportable! I have one for n=100K with a 10digit k. Gary Last fiddled with by gd_barnes on 20090408 at 05:26 

20090616, 18:53  #24 
May 2008
Wilmington, DE
2·13·109 Posts 
Just a side note. On my independent work, I just submitted 9615*2^9913471. A nice juicy one. 298430 digits.
My largest prime ever. Last fiddled with by MyDogBuster on 20090616 at 19:20 
20090617, 05:39  #25 
May 2007
Kansas; USA
2·5·1,009 Posts 
Way to go! A nice one! We've been missing the really big ones lately.

20090617, 23:34  #26 
Dec 2005
313_{10} Posts 

20090618, 07:10  #27 
May 2007
Kansas; USA
2·5·1,009 Posts 
One thing I forgot to mention: That one was PrimeSearch/NPLB's largest prime also!

20090618, 08:51  #28  
May 2008
Wilmington, DE
B12_{16} Posts 
Quote:


20090618, 08:54  #29 
Mar 2006
Germany
5·7·79 Posts 
... the next 'check' of a candidate? YESSSSSSSS!
Last fiddled with by kar_bon on 20090618 at 08:54 
20091021, 14:47  #30  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
10AB_{16} Posts 
Quote:
I'll post or edit this when I finish so everyone can know that the drive 9 primes have been checked for twins... Edit: I just realized I eliminated n != 0 mod 3, instead of k != 0 mod 3. Restarting...Edit 2: Included the n=200K350K primes from drive 9, too. Last fiddled with by MiniGeek on 20091021 at 15:12 

20091021, 15:55  #31  
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
Quote:
Any suggestions? SRsieve (I've got 0.6.9) is crashing when printing lines like this: "removed candidate sequence 1137*2^n+1 from the sieve", so that isn't working right to get the sieve started. Edit: Never mind, updated my srsieve and it finished to 1e6 without a problem. Last fiddled with by MiniGeek on 20091021 at 15:58 

20091021, 17:39  #32 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
4267_{10} Posts 
Done, no primes.

20091021, 21:48  #33 
May 2007
Kansas; USA
276A_{16} Posts 
Interesting. I had already done most of what you did 2 years ago for the top 5000 primes at that time. It took me quite a while and involved a lot of manual work. I encountered some of the same problems that you did so I had to resort to running multiple instances of srsieve or doing tests individually. It's nice to know that sr(x)sieve can handle multiple different forms where a k gets completely eliminated due to small factors now with the more recent releases. I seem to remember that the problem happened when there was just 12 primes of a specific k and the sieve eliminated all of them. It happened sometimes but not all of the time.
If you're really bold, you could try testing for twins on the entire top5000 database including the as of now, primes that are no longer top 5000. Due to the manual effort involved, I only did about 6070% of the top 5000 at that time and none of the nontop5000 at the time. You could even tweak your script or whatever to test for SophieGermains (SGs) or their Sierp equivalent; I can't remember what the latter are called. That would be cool if you found something. SGs have the exact same chance of occurring as twins but are not nearly as popular for searching so it takes a much lower one to make the top 20. One thing to keep in mind on twins that helped me out that perhaps you already thought of: The k must be divisible by 3. Before sieving, I put the primes in a spreadsheet, parsed out the kvalue, put a column in for the kvalue mod 3, and eliminated all k's where the 2nd column was not a 0. That helped me eliminate a fair percentage of them without even testing. Something similar may apply to SGs. Edit: I also took lists of primes from Karsten's pages. That's another source that you could use. I remember finding an n=~10K twin for k=915, although it wasn't big enough to make the top 20 twins at the time, which required an exponent of n=~66K. There are likely many primes on his lists that never made top 5000, especially for some of the huge k's that the RPS folks tested waybackwhen, that would be big enough to make the top 20 if they turned out to be twin or SG. Gary Last fiddled with by gd_barnes on 20091021 at 21:56 Reason: edit 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Mersenne Primes p which are in a set of twin primes is finite?  carpetpool  Miscellaneous Math  3  20170810 13:47 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
Thread for posting tiny primes  3.14159  Miscellaneous Math  945  20150726 21:43 
possible primes (real primes & poss.prime products)  troels munkner  Miscellaneous Math  4  20060602 08:35 
Deutscher Thread (german thread)  TauCeti  NFSNET Discussion  0  20031211 22:12 