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. 
[QUOTE=kar_bon;263806]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.[/QUOTE] Are you using ppsieve for this? I suspect for sieving a large range of starting k from 1 it would be faster. 
[QUOTE=henryzz;263856]Are you using ppsieve for this? I suspect for sieving a large range of starting k from 1 it would be faster.[/QUOTE]
No. I used pfgw for this range of small primes. Most of the values are already known in my database (where k<10000), so only the kvalues >10000 were done new. 
Status 2nd Quarter 2011
[b]Riesel:[/b]
8062 kvalues (7+) 164378 primes (1436+) 3462 twins (5+) 10565 Top5000links (1033+) [b]Proth:[/b] 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 
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'. 
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. 
I need to ask if you are interested in having CUDA TF available...

[QUOTE=Christenson;266655]I need to ask if you are interested in having CUDA TF available...[/QUOTE]
About 95% of my time I'm participating in the NPLB project and the ranges are already sieved to best fit. The last page I've done with PFGW, so no need to sieve fast and deep. 
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.

[QUOTE=Christenson;266679]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.[/QUOTE]
Not quite sure what you mean by "optimum", but I do understand "hitting the wall". That is the nature of exponential growth. 2^7 =128 
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.

All times are UTC. The time now is 02:46. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.