mersenneforum.org Sieving k*2^n-1 With Fixed n
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2013-02-01, 18:13 #1 c10ck3r     Aug 2010 Kansas 547 Posts 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!
2013-02-01, 20:14   #2
rogue

"Mark"
Apr 2003
Between here and the

177216 Posts

Quote:
 Originally Posted by c10ck3r 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?

2013-02-01, 22:48   #3
c10ck3r

Aug 2010
Kansas

547 Posts

Quote:
 Originally Posted by rogue Are you asking about sieving for a fixed value for n and variable k?
Yuppers.

2013-02-02, 02:58   #4
rogue

"Mark"
Apr 2003
Between here and the

2×3,001 Posts

Quote:
 Originally Posted by c10ck3r Yuppers.
Newpgen might, but I haven't used it in years. Outside of that I don't know of any.

 2013-02-02, 03:24 #5 Kosmaj     Nov 2003 362210 Posts Newpgen works great for fixed n, have you tried it?
2013-02-02, 04:12   #6
c10ck3r

Aug 2010
Kansas

10438 Posts

Quote:
 Originally Posted by Kosmaj 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.

 2013-02-02, 14:23 #7 pinhodecarlos     "Carlos Pinho" Oct 2011 Milton Keynes, UK 10010101001012 Posts 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
 2013-02-02, 15:48 #8 firejuggler     Apr 2010 Over the rainbow 1001101001102 Posts ppsieve might work
2013-02-02, 16:25   #9
c10ck3r

Aug 2010
Kansas

547 Posts

Quote:
 Originally Posted by pinhodecarlos 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.

2013-02-02, 16:44   #10
rogue

"Mark"
Apr 2003
Between here and the

2×3,001 Posts

Quote:
 Originally Posted by c10ck3r 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.

2013-02-02, 16:55   #11
c10ck3r

Aug 2010
Kansas

10438 Posts

Quote:
 Originally Posted by rogue 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...

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue Software 38 2018-02-11 00:08 diep GPU Computing 5 2016-09-23 19:19 pepi37 Software 7 2015-07-10 04:42 Jean PennĂ© Software 0 2011-01-22 16:47 KEP Twin Prime Search 3 2007-02-13 18:29

All times are UTC. The time now is 03:06.

Wed Nov 25 03:06:07 UTC 2020 up 76 days, 17 mins, 4 users, load averages: 1.51, 1.33, 1.30