20051102, 10:32  #12 
Aug 2003
Europe
2×97 Posts 
New forum?
Shouldn't the posts concerning RPS be moved to the newly created forum? http://mersenneforum.org/forumdisplay.php?f=59

20060317, 10:56  #13  
Oct 2003
Croatia
2^{3}×3×19 Posts 
Quote:


20120817, 09:47  #14 
Nov 2003
E26_{16} Posts 
I'll try to collect answers to some frequent questions, a kind of FAQ, and the first one is:
Q: What does the first line of the LLR input (NewPGen output) file means? A: this thread 
20120817, 10:05  #15 
Nov 2003
2×1,811 Posts 
Q: Can I sieve myself?
A: Yes, for k*2^n1 and k*2^n+1, fixed k, the fastest sieving program to use is srsieve. Use sr1sieve to sieve a single k, or sr2sieve to sieve multiple k's at once. However, for k<10000 (=10^4), on both plus and minus side, Psieve already sieved deep enough all n<3M (3E6). Larger exponents up to about n=6M are still being sieved but the latest output files are already well sieved and can be used for prime search. In short, for k<10000 use the Psieve files and give credit to them, for k>10000 sieve yourself using srsieve. 
20120913, 05:08  #16 
Mar 2012
Hyderabad, India
3×17 Posts 
i'm trying to run srseive on linux
can you help me with a sample input 
20120913, 09:32  #17  
Feb 2003
2·13·73 Posts 
Quote:
Code:
./srsieve 12345*2^n1 n 1000000 N 1200000 f Of course, you may specify more than one sequence (multiple k). pmin and pmax can be specified by "p" and "P". If not given, the sieve will start at p=2 and will run until manually stopped (by pressing CtrlC). The output will be written to the file "srsieve.out". This file may be converted by using the tool called "srfile": Code:
./srfile g srsieve.out Hope this helps... Last fiddled with by Thomas11 on 20120913 at 09:38 

20120914, 03:33  #18 
"Curtis"
Feb 2005
Riverside, CA
2^{2}·11·89 Posts 
I believe srsieve accepts the srfile flags for file type directly. So, you can end your srsieve command with a g or G to produce LLRreadable output directly.
Curtis 
20120914, 04:36  #19 
Mar 2012
Hyderabad, India
3×17 Posts 
ok so far so good
I figured out srseive and sr1seive, playing with them :) now how do i give multiple k's? Last fiddled with by shanecruise on 20120914 at 05:05 Reason: made some progress :D 
20120914, 08:11  #20  
Feb 2003
11101101010_{2} Posts 
Quote:
Code:
./srsieve 12345*2^n1 12347*2^n1 12349*2^n1 n 1000000 N 1200000 Quote:


20120914, 09:34  #21 
Nov 2003
E26_{16} Posts 
Of course you can sieve Mersenne primes with srsieve but it will very unefficient, because srsieve is a general purpose sieving software not employing the fact that factors can be only of form 2*m*n+1 (of 2^n1). So even PrimeForm which has this feature will be faster than srsieve. But Gimps has many more speedups, and can do P1 test, ecm curves and so on. You can download Gimps and try sieving without joining the project.
Regarding 5*n^21, can you tell us which file have you tried to sieve, and what factors have you found? Those test files are not the latest version, but they are fairly new, from a sieving file released a few months ago. 
20120914, 09:51  #22 
Mar 2012
Hyderabad, India
3×17 Posts 
told you just playing with things :)

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
AouessareEl HaddouchiEssaaidi "test": "if Mp has no factor, it is prime!"  wildrabbitt  Miscellaneous Math  11  20150306 08:17 
Riesel Primes k*2^n1, k<300 [Was "k=1"]  wpolly  Riesel Prime Search  599  20070708 00:12 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 
Search for a number theoretic function related to "prime divisor sums"  juergen  Math  2  20040710 23:01 
The "Aaron Blosser" Search Warrant  Gary Edstrom  Lounge  6  20031106 21:47 