20200112, 18:07  #265 
Sep 2011
Germany
2^{3}·313 Posts 

20200113, 01:20  #266 
"Mark"
Apr 2003
Between here and the
2^{2}×3^{3}×5×11 Posts 

20200113, 07:47  #267 
"Alexander"
Nov 2008
The Alamo City
2·193 Posts 
If it's the same issue as before, I posted a fix at https://www.mersenneforum.org/showpo...&postcount=195. It wasn't in SVN last time I checked.

20200113, 13:51  #268  
"Mark"
Apr 2003
Between here and the
2^{2}×3^{3}×5×11 Posts 
Quote:


20200113, 21:23  #269  
"Mark"
Apr 2003
Between here and the
2^{2}×3^{3}×5×11 Posts 
Quote:
srsieve now supports ABNP options for the file format. If they don't work as desired, please let me know. Option B is the one that generates a newpgen like header for BOINC. I think that ABC is the PRP format that you are looking for, but as I stated above, I haven't had time to test. I had made these changes months ago. Last fiddled with by rogue on 20200113 at 21:25 

20200114, 16:33  #270 
Sep 2011
Germany
2504_{10} Posts 
Thx rogue, still not working:
output: Code:
n:\sierpbase267>srsieve2 n2501 N10000 P1e9 spl_remain.txt fB srsieve2 v1.2, a program to find factors of k*b^n+c numbers for fixed b and vari able k and n Sieving with generic logic n:\sierpbase267>pause 
20200114, 17:19  #271  
"Mark"
Apr 2003
Between here and the
2^{2}×3^{3}×5×11 Posts 
Quote:


20200115, 14:52  #272 
"Alexander"
Nov 2008
The Alamo City
2×193 Posts 
I'm getting a segfault with srsieve2 from SVN:
Code:
$ ./srsieve2 W 3 n 1 N 1500000 P 1e9 o t17_b2.prp f B s "963643*2^n1" srsieve2 v1.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic Segmentation fault (core dumped) 
20200115, 15:23  #273  
"Mark"
Apr 2003
Between here and the
1011100110100_{2} Posts 
Quote:


20200115, 19:22  #274  
"Mark"
Apr 2003
Between here and the
2^{2}·3^{3}·5·11 Posts 
Quote:


20200115, 19:29  #275  
"Mark"
Apr 2003
Between here and the
2^{2}·3^{3}·5·11 Posts 
Quote:
Code:
srsieve2 W 3 n 100 N 1500000 P 1e9 o t17_b2.prp f B s "963643*2^n1" srsieve2 v1.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic Sieve started: 2 < p < 1e9 with 1499901 terms (100 < n < 1500000, k*2^n+c) (expecting 1449733 factors) Sieving with generic logic Split 1 base 2 sequence into 1 base 2^120 sequences. Fatal Error: 963643*2^142631 mod 269 = 142 Code:
srsieve2 W 3 n 1 N 200 P 1e9 o t17_b2.prp f B s "963643*2^n1" srsieve2 v1.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic Sieve started: 2 < p < 1e9 with 200 terms (1 < n < 200, k*2^n+c) (expecting 193 factors) Sequence 963643*2^n1 removed as all terms have a factor Fatal Error: All sequences have been removed srsieve2 W 3 n 200 N 5000 P 1e9 o t17_b2.prp f B s "963643*2^n1" srsieve2 v1.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic Sieve started: 2 < p < 1e9 with 4801 terms (200 < n < 5000, k*2^n+c) (expecting 4640 factors) Sieving with generic logic Split 1 base 2 sequence into 1 base 2^24 sequences. Sieving with generic logic Split 1 base 2 sequence into 1 base 2^24 sequences. CTRLC accepted. Please wait for threads to complete. Sieve interrupted at p=694848779. Processor time: 21.72 sec. (0.39 sieving) (2.82 cores) 8 terms written to t17_b2.prp Primes tested: 33000000. Factors found: 0. Remaining terms: 8. Time: 7.69 seconds. 
