20100117, 18:36  #12 
"Mark"
Apr 2003
Between here and the
6,529 Posts 

20100123, 21:07  #13 
"Mark"
Apr 2003
Between here and the
6,529 Posts 
Gary, are there any sieve files for these k? If so, could a link be added to those files in the first post?

20100124, 03:36  #14  
May 2007
Kansas; USA
295F_{16} Posts 
Quote:
After a quick check of unreserved bases with one k remaining, there are sieve files available only for Riesel bases 22 and 26; the latter just recently completed by Max. I know base 26 is sufficiently sieved but you might do some testing on base 22 to see if it is sieved far enough. I'll put a note in the 1st post that a sieve file is available for those. Last fiddled with by gd_barnes on 20100124 at 03:36 

20100310, 10:40  #15 
May 2007
Kansas; USA
24537_{8} Posts 
The aliquot sequences project has a good thread called "recommended sequences". I like that idea and may start a thread for "recommended k's or bases" in the future. In the mean time, I'd like to start out by recommending a base to test with one k remaining:
2*170^n1 for n=50K to (at least) n=100K This is the smallest Riesel base that has k=2 remaining and it would be great to push it higher. The smallest with k=2 remaining on the Sierp side is base 101, which has already been searched to n=100K and is reserved by Ian to n=200K. So that one is well covered. This thread was an excellent start by Mark to give some direction to this huge allencompassing project. So I'll attempt to narrow things down a little further at times with occassional recommended bases and k's. Gary 
20100408, 21:31  #16 
May 2007
Kansas; USA
7·17·89 Posts 
Mark had another good suggestion about 1k's in another thread: Compute the weight of each k remaining.
If anyone knows a program that can be run that can compute the weight of each of these k's and can post it here, that would be very helpful. I'll then add it to the first post. 
20100408, 21:40  #17 
Sep 2006
Germany
2·5·19 Posts 
If you could tell me, how to compute it, I could write a script..
I think, It's something like "Sieve n = 1  1000 to P = %something% and look, how many n are remaining"? This should be possible with srsieve easily? 
20100408, 22:04  #18  
"Mark"
Apr 2003
Between here and the
6,529 Posts 
Quote:


20100408, 22:20  #19 
Mar 2006
Germany
2×5×293 Posts 
The standard Nashweight was defined as nvalues remaining after sieving the range 100001<=n<=110000 up to p=511.
So with srsieve the command Code:
srsieve n 100001 N 110000 P 511 "301*2^n1" The small program 'nash' from T.Ritschel given here calculates a weight of 2158 for this kvalue. I'm using this program to show the Nash weights on www.rieselprime.de for all kvalues. Doing a script for some values should work with all bases and result in a compareable value for all. 
20100408, 23:24  #20 
Mar 2006
Germany
2·5·293 Posts 
Attached a file with all onekremainingconjectures from post #1 with their weights (candidates left) with the mentioned srsievecommand above.

20100409, 00:05  #21 
"Mark"
Apr 2003
Between here and the
6,529 Posts 
I have 2*1004^n+1 reserved. See this thread. That's just in case someone tries to take it themselves.
Aren't I so lucky to get S227? It has the lowest weight... Last fiddled with by rogue on 20100409 at 00:06 
20100409, 04:40  #22  
May 2007
Kansas; USA
10100101011111_{2} Posts 
Quote:
Quote:
Gary 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
P1 factoring attempts at smallestremaining Mersenne numbers with no known factors  UberNumberGeek  Factoring  51  20170213 20:30 
20 Easy Pieces  The Remaining 29bit Jobs  swellman  XYYXF Project  5  20160227 22:35 
Discussion about CPU time needed and k's remaining  Siemelink  Conjectures 'R Us  41  20080711 23:05 
Easiest Remaining Cunninghams  R.D. Silverman  Factoring  1  20080312 03:34 
distribution of remaining candidates  thommy  3*2^n1 Search  41  20040411 22:05 