20230603, 11:45  #1211  
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
1858_{16} Posts 
Quote:


20230603, 12:29  #1212 
"Mark"
Apr 2003
Between here and the
3·5·499 Posts 

20230605, 11:47  #1213 
Jun 2012
Boulder, CO
111111000_{2} Posts 
FYI, latest SVN build of srsieve2 segfaults on some fairly reasonable looking inputs.
Code:
$ ./srsieve2 s "7*2^n1" P 1e13 n 8e6 N 20e6 W 36 o out.txt srsieve2 v1.7, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic for p >= 3 Sieve started: 3 <= p <= 1e13 with 12000001 terms (8000000 <= n <= 20000000, k*2^n1) (expecting 11559581 factors) Sieving with single sequence c=1 logic for p >= 257 BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 1 base 2 sequence into 23 base 2^180 sequences. Legendre summary: Approximately 4 bytes needed for Legendre tables 1 total sequences 1 are eligible for Legendre tables 0 are not eligible for Legendre tables 0 have Legendre tables in memory 1 cannot have Legendre tables in memory 0 have Legendre tables loaded from files 0 required building of the Legendre tables 518400 bytes used for congruent q and ladder indices 259200 bytes used for congruent qs and ladders Segmentation fault 
20230605, 12:04  #1214  
"Mark"
Apr 2003
Between here and the
1D3D_{16} Posts 
Quote:


20230605, 14:30  #1215 
"Mark"
Apr 2003
Between here and the
1D3D_{16} Posts 
I found a bug when it generated Legendre tables for single sequences. I fixed that and pushed the code change.
But I ran into another issue. I have a workaround, but I suspect another bug that I need to dig into. 
20230607, 13:39  #1216 
"Mark"
Apr 2003
Between here and the
3×5×499 Posts 
mtsieve 2.4.9 is released. Here are the changes:
Code:
framework: Added command line switch 6. When the removal rate is computed as "seconds per factor", this is the number of minutes to includes in that rate. It can exceed that number of minutes, but only if no factors are found. fnbcsieve: version 1.7.1 For base 2 do not adjust mink or maxk when they are even. End user can use r to remove those terms. srsieve2/srsieve2cl: version 1.7.1 Fix two issues with generating Legendre tables that can cause program to crash. Fix issue where some sequences are removed due to incorrect algebraic factorizations. Code:
Add feature to compute rate for the last xx factors instead of seconds per factor. 
20230610, 19:08  #1217 
Jun 2012
Boulder, CO
2^{3}×3^{2}×7 Posts 
I'm also seeing xyyxsievecl hang on inputs like this:
Code:
$ ./xyyxsievecl s "" x 3 X 16 y 1e6 Y 1200e3 g 16 G 16 P 1e8 o xyyx_minus.txt xyyxsieve v2.0, a program to find factors numbers of the form x^y+y^x or x^yy^x Quick elimination of terms info (in order of check): 0 because x >= y 1400007 because the term is even 265357 because x and y have a common divisor 
20230610, 21:54  #1218  
Dec 2011
After 1.58M nines:)
11011110010_{2} Posts 
I do some more experiment with srsieve2cl to find fastest way for sieving single sequence. Regardless fact it is "simple fact" i will ask to confirm
Quote:


20230615, 12:54  #1219 
"Alexander"
Nov 2008
The Alamo City
10000000100_{2} Posts 
All of the nonOpenCL executable directives in the Makefile include $(LD_FLAGS_OPENCL), which fails on computers without OpenCL.

20230615, 14:16  #1220 
"Mark"
Apr 2003
Between here and the
3·5·499 Posts 

20230616, 20:53  #1221  
"Alexander"
Nov 2008
The Alamo City
2^{2}×257 Posts 
Quote:
Line 386 of the Makefile (the rule for srsieve2) is: Code:
$(CC) $(CPP_FLAGS) $(OPT_CPP_FLAGS) $(LD_FLAGS_OPENCL) o $@ $^ $(LD_FLAGS) Last fiddled with by Happy5214 on 20230616 at 20:57 
