20230530, 15:09  #1200 
"Mark"
Apr 2003
Between here and the
2^{6}×3^{2}×13 Posts 
I have committed a code change and an update to the makefile. So if you are interesting in "giving it a spin", please do so. I think it should be faster than the version you are using now. The main difference is that since the range of x and y exceed the number of actual candidates, it will store the list of candidates differently and iterate thru them differently. Unfortunately there is no great way to optimize the sieving based upon the input.
Last fiddled with by rogue on 20230530 at 15:09 
20230530, 15:43  #1201  
"Mark"
Apr 2003
Between here and the
2^{6}·3^{2}·13 Posts 
Quote:
Code:
srsieve2 n3 N100e3 p3 P1e9 W7 s"22*173^n1" o1e9.abcd 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 < 1e9 with 99998 terms (3 <= n <= 100000, k*173^n1) (expecting 94697 factors) Sieving with single sequence c=1 logic for p >= 257 BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 1 base 173 sequence into 15 base 173^60 sequences. Legendre summary: Approximately 952 bytes needed for Legendre tables ... removed ... Increasing worksize to 2000000 since each chunk is tested in less than a second Sieve completed at p=1026219533. CPU time: 48.14 sec. (0.47 sieving) (4.84 cores) 3384 terms written to 1e9.abcd Primes tested: 50847327. Factors found: 96614. Remaining terms: 3384. Time: 9.95 seconds. srsieve2 n3 N100e3 p3 P1e9 W7 s"22*173^n+1" o1e9.abcd 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 < 1e9 with 99998 terms (3 <= n <= 100000, k*173^n+1) (expecting 94697 factors) Sieving with single sequence c=1 logic for p >= 257 BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 1 base 173 sequence into 27 base 173^60 sequences. Legendre summary: Approximately 6 bytes needed for Legendre tables ... removed ... Increasing worksize to 2000000 since each chunk is tested in less than a second Sieve completed at p=1000000007. CPU time: 57.88 sec. (0.48 sieving) (4.91 cores) 7644 terms written to 1e9.abcd Primes tested: 50847326. Factors found: 92354. Remaining terms: 7644. Time: 11.79 seconds. Last fiddled with by rogue on 20230530 at 15:44 

20230530, 16:33  #1202 
Random Account
Aug 2009
Oceanus Procellarum
2×3^{2}×13^{2} Posts 
It is the one packaged with the srbsieve archive with an internal date of 5/24/2023. The one within mtsieve 2.4.7 has an internal date of 4/13/2023. I look at these with the file properties. Extracting them changes the visible date stamp in the file explorer. I honestly can't say if I ever tried the latter.

20230530, 17:03  #1203 
"Mark"
Apr 2003
Between here and the
16500_{8} Posts 
There is mtsieve_2.4.6.7z and mtsieve_2.4.7.7z. 2.4.7 is the latest and is the one I ran without an issue.

20230530, 22:45  #1204  
Random Account
Aug 2009
Oceanus Procellarum
2×3^{2}×13^{2} Posts 
Quote:
The one I mentioned from April is v1.6.9, so scrap that one. An srbsieve_1.3 archive containing 21 files and mtsieve v2.4.7 both have srsieve2 in them. The date stamps are one day apart even though the file lengths are the same. I think I will just wait and see if this happens again. 

20230531, 00:05  #1205  
"Mark"
Apr 2003
Between here and the
16500_{8} Posts 
Quote:


20230531, 14:01  #1206 
Random Account
Aug 2009
Oceanus Procellarum
2·3^{2}·13^{2} Posts 

20230531, 15:45  #1207 
"Mark"
Apr 2003
Between here and the
7488_{10} Posts 
That srsieve2 is current. If I included in the srbsieve package, then I made a mistake.

20230601, 18:21  #1208 
"Mark"
Apr 2003
Between here and the
16500_{8} Posts 
mtsieve 2.4.8 is released. Here are the changes:
Code:
fbncsieve: version 1.7 No longer remove even k for base 2. Ensure that odd bases only report even k that are removed. Ignore factors for terms where k is outside of specified range. xyyxsieve/xyyxsievecl: version 2.0 If the range of x or the range of y is greater than the number of candidates, then different logic is used to manage the candidates and iterate over them. 
20230602, 23:28  #1209 
Dec 2011
After 1.58M nines:)
13×137 Posts 
Can you write ( inside mtsieve package) small program that will show is alg factors in specific sequence ( that user choose) and write small report like number of alg factors?
That can be used for confirming there is no alg factors left in seqeunce Last fiddled with by pepi37 on 20230602 at 23:29 
20230603, 07:13  #1210 
Dec 2011
After 1.58M nines:)
13×137 Posts 
srsieve2 ( from last package 2.4.8)
If I try to apply factors I got error Fatal Error: Invalid factor: 16*767^504684+1 mod 10994911890479476681 = 8563234858453284832 Fatal Error: Invalid factor: 4*767^500350+1 mod 18446744073709551615 = 2 Factor are confirmed (16*767^504684+1)%10994911890479476681 is Zero (0) (4*767^500350+1)%367677432715278443521 is Zero (0) Last fiddled with by pepi37 on 20230603 at 07:23 