mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2013-02-01, 18:13   #1
c10ck3r
 
c10ck3r's Avatar
 
Aug 2010
Kansas

547 Posts
Default Sieving k*2^n-1 With Fixed n

Okay, so I'm afraid I'm reviving an old thread, but I don't think my question really has enough substance to merit a new thread. My question is:
How would one go about creating a test file for numbers of the form k*2^n-1 or k*2^n+1 for a set "n" value other than using Newpgen? Or, I guess the question I should be asking is: What is the most efficient method for doing so?
Thanks in advance!
c10ck3r is offline   Reply With Quote
Old 2013-02-01, 20:14   #2
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×3,001 Posts
Default

Quote:
Originally Posted by c10ck3r View Post
Okay, so I'm afraid I'm reviving an old thread, but I don't think my question really has enough substance to merit a new thread. My question is:
How would one go about creating a test file for numbers of the form k*2^n-1 or k*2^n+1 for a set "n" value other than using Newpgen? Or, I guess the question I should be asking is: What is the most efficient method for doing so?
Thanks in advance!
Are asking about sieving for a fixed value for n and variable k?
rogue is offline   Reply With Quote
Old 2013-02-01, 22:48   #3
c10ck3r
 
c10ck3r's Avatar
 
Aug 2010
Kansas

547 Posts
Default

Quote:
Originally Posted by rogue View Post
Are you asking about sieving for a fixed value for n and variable k?
Yuppers.
c10ck3r is offline   Reply With Quote
Old 2013-02-02, 02:58   #4
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×3,001 Posts
Default

Quote:
Originally Posted by c10ck3r View Post
Yuppers.
Newpgen might, but I haven't used it in years. Outside of that I don't know of any.
rogue is offline   Reply With Quote
Old 2013-02-02, 03:24   #5
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

Newpgen works great for fixed n, have you tried it?
Kosmaj is offline   Reply With Quote
Old 2013-02-02, 04:12   #6
c10ck3r
 
c10ck3r's Avatar
 
Aug 2010
Kansas

547 Posts
Default

Quote:
Originally Posted by Kosmaj View Post
Newpgen works great for fixed n, have you tried it?
Yup. That's what I had started with, but I didn't know if there was anything faster.
c10ck3r is offline   Reply With Quote
Old 2013-02-02, 14:23   #7
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

3·37·43 Posts
Default k*2^n-1, k<300

If you want to help on Riesel primes search for k*2^n-1, k<300, you need to check webpage http://www.15k.org/riesellist.html because this one has the latest updates.

Carlos
pinhodecarlos is online now   Reply With Quote
Old 2013-02-02, 15:48   #8
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

2·5·13·19 Posts
Default

ppsieve might work
firejuggler is offline   Reply With Quote
Old 2013-02-02, 16:25   #9
c10ck3r
 
c10ck3r's Avatar
 
Aug 2010
Kansas

547 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
If you want to help on Riesel primes search for k*2^n-1, k<300, you need to check webpage http://www.15k.org/riesellist.html because this one has the latest updates.

Carlos
I'm aware of this site. It appears that it searches for fixed k, not fixed n like I was asking, though.
c10ck3r is offline   Reply With Quote
Old 2013-02-02, 16:44   #10
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

2×3,001 Posts
Default

Quote:
Originally Posted by c10ck3r View Post
I'm aware of this site. It appears that it searches for fixed k, not fixed n like I was asking, though.
Can I ask why you would want such a sieve? Note that a sieve like that would be very inefficient compared to existing sieves. It wouldn't scale very well as the range of k increases.
rogue is offline   Reply With Quote
Old 2013-02-02, 16:55   #11
c10ck3r
 
c10ck3r's Avatar
 
Aug 2010
Kansas

547 Posts
Default

Quote:
Originally Posted by rogue View Post
Can I ask why you would want such a sieve? Note that a sieve like that would be very inefficient compared to existing sieves. It wouldn't scale very well as the range of k increases.
http://primes.utm.edu/primes/lists/all.txt
Think lines 995-1230, except make them top-500. Zat's the goal...
c10ck3r is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
fbncsieve - a new fixed n sieve rogue Software 38 2018-02-11 00:08
Sieving k * 2^n +- c with Nvidia GPU's for fixed k diep GPU Computing 5 2016-09-23 19:19
A siever for K (b, n, c fixed)? pepi37 Software 7 2015-07-10 04:42
User interface bug fixed on LLR V3.8.4 Jean Penné Software 0 2011-01-22 16:47
KEP is reporting computer fixed KEP Twin Prime Search 3 2007-02-13 18:29

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

Wed Nov 25 11:50:17 UTC 2020 up 76 days, 9:01, 4 users, load averages: 1.56, 1.48, 1.47

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.