![]() |
![]() |
#1 |
Dec 2011
After milion nines:)
138910 Posts |
![]()
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 |
![]() |
![]() |
![]() |
#2 |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
722110 Posts |
![]()
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 |
![]() |
![]() |
![]() |
#4 |
Dec 2011
After milion nines:)
3×463 Posts |
![]()
Fixed b,fixed n, fixed c
So only k is not fixed Oh I sow error in my first post: so sorry about that Last fiddled with by pepi37 on 2015-07-09 at 19:01 Reason: add more info |
![]() |
![]() |
![]() |
#5 |
"Mark"
Apr 2003
Between here and the
6,163 Posts |
![]() |
![]() |
![]() |
![]() |
#6 |
Dec 2011
After milion nines:)
3×463 Posts |
![]() |
![]() |
![]() |
![]() |
#7 | |
Jun 2003
10010111010102 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#8 | |
"Robert Gerbicz"
Oct 2005
Hungary
22×3×7×17 Posts |
![]() Quote:
(you can still compute these cc values for each prime, and use a program, but that's a painful approach of the problem). |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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-1 With Fixed n | c10ck3r | Riesel Prime Search | 14 | 2013-02-03 00:19 |
User interface bug fixed on LLR V3.8.4 | Jean Penné | Software | 0 | 2011-01-22 16:47 |
Making a 64-bit fixed N Proth siever | Ken_g6 | Programming | 32 | 2009-08-03 19:25 |
KEP is reporting computer fixed | KEP | Twin Prime Search | 3 | 2007-02-13 18:29 |