20110614, 23:09  #23 
Mar 2006
Germany
3×7×137 Posts 
I've included a new page:
First odd k, for which k*2^n1 is prime, n<=10000 Maximum kvalue so far: k=55999 for n=8867. A graph presents all values. I plan to continue this table and add such page for k*2^n+1, too. 
20110615, 17:10  #24 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
2·2,909 Posts 
Are you using ppsieve for this? I suspect for sieving a large range of starting k from 1 it would be faster.

20110616, 07:40  #25  
Mar 2006
Germany
3×7×137 Posts 
Quote:
Most of the values are already known in my database (where k<10000), so only the kvalues >10000 were done new. 

20110708, 09:49  #26 
Mar 2006
Germany
3·7·137 Posts 
Status 2nd Quarter 2011
Riesel:
8062 kvalues (7+) 164378 primes (1436+) 3462 twins (5+) 10565 Top5000links (1033+) Proth: 5000 kvalues 149539 primes 2271 twins 21819 Top5000links  Changes since last Status (3rd Quarter 2010)  Prothside still only kvalues < 10000  Statspage, Prime and Twinlists (for download) will be updated later today 
20110709, 01:24  #27 
Mar 2006
Germany
101100111101_{2} Posts 
I've included a 'new' page with my first version of these pages online in 2007 at RPS to see, how much the data and lookalike changed since then.
There's also a link to the thread in this forum, where I announced that page and the development is shown. You can find these updates in the Menu 'General' > 'History'. 
20110715, 22:02  #28 
Mar 2006
Germany
2877_{10} Posts 
I've included a new page for the first odd k, for which k*2^n+1 is prime, n<=10000.
A graph is shown, too. 
20110717, 03:46  #29 
Dec 2010
Monticello
5×359 Posts 
I need to ask if you are interested in having CUDA TF available...

20110717, 11:13  #30 
Mar 2006
Germany
3×7×137 Posts 

20110717, 12:51  #31 
Dec 2010
Monticello
5×359 Posts 
At least with Mersennes, TF on CUDA can be ~100x faster than TF on CPUs...moving up the optimum sieving by half a dozen bits.

20110717, 16:13  #32 
"Lucan"
Dec 2006
England
2·3·13·83 Posts 

20110717, 16:24  #33 
Dec 2010
Monticello
1795_{10} Posts 
By optimum I mean minimizing the total expected effort expended against a given set of interesting expressions/numbers to classify them all. For mersenne numbers, that means showing that a factor exists and once in a long while showing that it doesn't. For these, it might be getting to a known factor or knowing the expression is prime.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
News  gd_barnes  Conjectures 'R Us  299  20210219 09:30 
News  gd_barnes  No Prime Left Behind  251  20210215 03:00 
Other news  Cruelty  Riesel Prime Search  41  20100308 18:46 
The news giveth, the news taketh away...  NBtarheel_33  Hardware  17  20090504 15:52 
News  KEP  Riesel Base 3 Attack  4  20081217 11:54 