mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Open Projects > Riesel Prime Data Collecting (k*2^n-1)

Reply
 
Thread Tools
Old 2011-06-14, 23:09   #23
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

55558 Posts
Default

I've included a new page:

First odd k, for which k*2^n-1 is prime, n<=10000

Maximum k-value 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.
kar_bon is offline   Reply With Quote
Old 2011-06-15, 17:10   #24
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

25·5·37 Posts
Default

Quote:
Originally Posted by kar_bon View Post
I've included a new page:

First odd k, for which k*2^n-1 is prime, n<=10000

Maximum k-value 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.
Are you using ppsieve for this? I suspect for sieving a large range of starting k from 1 it would be faster.
henryzz is online now   Reply With Quote
Old 2011-06-16, 07:40   #25
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32·52·13 Posts
Default

Quote:
Originally Posted by henryzz View Post
Are you using ppsieve for this? I suspect for sieving a large range of starting k from 1 it would be faster.
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 k-values >10000 were done new.
kar_bon is offline   Reply With Quote
Old 2011-07-08, 09:49   #26
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32·52·13 Posts
Default Status 2nd Quarter 2011

Riesel:
8062 k-values (7+)
164378 primes (1436+)
3462 twins (5+)
10565 Top5000-links (1033+)

Proth:
5000 k-values
149539 primes
2271 twins
21819 Top5000-links

- Changes since last Status (3rd Quarter 2010)
- Proth-side still only k-values < 10000
- Stats-page, Prime- and Twin-lists (for download) will be updated later today
kar_bon is offline   Reply With Quote
Old 2011-07-09, 01:24   #27
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32×52×13 Posts
Default

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'.
kar_bon is offline   Reply With Quote
Old 2011-07-15, 22:02   #28
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32·52·13 Posts
Default

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.
kar_bon is offline   Reply With Quote
Old 2011-07-17, 03:46   #29
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

111000000112 Posts
Default

I need to ask if you are interested in having CUDA TF available...
Christenson is offline   Reply With Quote
Old 2011-07-17, 11:13   #30
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

32×52×13 Posts
Default

Quote:
Originally Posted by Christenson View Post
I need to ask if you are interested in having CUDA TF available...
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.
kar_bon is offline   Reply With Quote
Old 2011-07-17, 12:51   #31
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

111000000112 Posts
Default

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.
Christenson is offline   Reply With Quote
Old 2011-07-17, 16:13   #32
davieddy
 
davieddy's Avatar
 
"Lucan"
Dec 2006
England

2×3×13×83 Posts
Default

Quote:
Originally Posted by Christenson View Post
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.
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
davieddy is offline   Reply With Quote
Old 2011-07-17, 16:24   #33
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

34038 Posts
Default

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.
Christenson is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
News gd_barnes Conjectures 'R Us 303 2021-10-01 20:47
News gd_barnes No Prime Left Behind 253 2021-08-15 05:26
Other news Cruelty Riesel Prime Search 41 2010-03-08 18:46
The news giveth, the news taketh away... NBtarheel_33 Hardware 17 2009-05-04 15:52
News KEP Riesel Base 3 Attack 4 2008-12-17 11:54

All times are UTC. The time now is 13:11.


Thu Oct 21 13:11:43 UTC 2021 up 90 days, 7:40, 1 user, load averages: 1.13, 1.32, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.