mersenneforum.org A siever for K (b, n, c fixed)?
 Register FAQ Search Today's Posts Mark Forums Read

 2015-07-09, 15:30 #1 pepi37     Dec 2011 After milion nines:) 56E16 Posts A siever for K (b, n, c fixed)? Is anybody know where to find it? I know that NewPgen can do fixed k sieve, but I am interesting is any newer ( faster) siever for fixed K? Thanks
2015-07-09, 16:56   #2
rogue

"Mark"
Apr 2003
Between here and the

618510 Posts

Quote:
 Originally Posted by pepi37 Is anybody know where to find it? I know that NewPgen can do fixed k sieve, but I am interesting is any newer ( faster) siever for fixed K? Thanks
Fixed or variable b? Fixed or variable n? Fixed or variable c?

2015-07-09, 18:32   #3
Dubslow

"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3×29×83 Posts

Quote:
 Originally Posted by rogue Fixed or variable b? Fixed or variable n? Fixed or variable c?
I believe he is referring to Mersenne numbers only, where instead of fixing p and trying a bunch of k (as is standard), fix k and try all p (i.e. n) from (presumably) 1 to 10e9 (PrimeNet's current table boundary). User Tjaoi is known to be sieving Mersennes this way.

I could of course be wrong in my interpretation, but hey.

Last fiddled with by Dubslow on 2015-07-09 at 18:33

2015-07-09, 19:01   #4
pepi37

Dec 2011
After milion nines:)

2×5×139 Posts

Quote:
 Originally Posted by rogue Fixed or variable b? Fixed or variable n? Fixed or variable c?
Fixed b,fixed n, fixed c
So only k is not fixed
Oh I sow error in my first post: so sorry about that

2015-07-09, 19:17   #5
rogue

"Mark"
Apr 2003
Between here and the

618510 Posts

Quote:
 Originally Posted by pepi37 Fixed b,fixed n, fixed c So only k is not fixed Oh I sow error in my first post: so sorry about that
I believe that you can use fnsievecl. It is fixed k, b, and n with variable c. You can convert k*b^n+c to b^n+c/k by computing the numerical inverse.

2015-07-09, 21:01   #6
pepi37

Dec 2011
After milion nines:)

2·5·139 Posts

Quote:
 Originally Posted by rogue I believe that you can use fnsievecl. It is fixed k, b, and n with variable c. You can convert k*b^n+c to b^n+c/k by computing the numerical inverse.
So I need sieve program that can made
K=2-200000
b=10
n=1000000
c=1
fncievecl cannot do that

2015-07-10, 03:52   #7
axn

Jun 2003

3×5×17×19 Posts

Quote:
 Originally Posted by pepi37 Is anybody know where to find it? I know that NewPgen can do fixed k sieve, but I am interesting is any newer ( faster) siever for fixed K? Thanks
Quote:
 Originally Posted by pepi37 So I need sieve program that can made K=2-200000 b=10 n=1000000 c=1 fncievecl cannot do that
This is what NewPGen is built to do! NewPGen also does fixed-k, but fixed-n is where it really shines.

2015-07-10, 04:42   #8
R. Gerbicz

"Robert Gerbicz"
Oct 2005
Hungary

101100101012 Posts

Quote:
 Originally Posted by rogue I believe that you can use fnsievecl. It is fixed k, b, and n with variable c. You can convert k*b^n+c to b^n+c/k by computing the numerical inverse.
That is not working. For different p values you will get very different cc=c/k mod p values, so here cc is not fixed.
(you can still compute these cc values for each prime, and use a program, but that's a painful approach of the problem).

 Similar Threads Thread Thread Starter Forum Replies Last Post rogue Software 38 2018-02-11 00:08 c10ck3r Riesel Prime Search 14 2013-02-03 00:19 Jean PennĂ© Software 0 2011-01-22 16:47 Ken_g6 Programming 32 2009-08-03 19:25 KEP Twin Prime Search 3 2007-02-13 18:29

All times are UTC. The time now is 14:16.

Sat Jan 23 14:16:15 UTC 2021 up 51 days, 10:27, 0 users, load averages: 3.47, 2.88, 2.85