mersenneforum.org mtsieve
 Register FAQ Search Today's Posts Mark Forums Read

 2022-03-22, 00:13 #617 pepi37     Dec 2011 After milion nines:) 32·173 Posts What is use of k1b2sieve? ( what kind of sieve files we got, or what type of prime we search) Thanks
2022-03-22, 12:20   #618
rogue

"Mark"
Apr 2003
Between here and the

667810 Posts

Quote:
 Originally Posted by pepi37 What is use of k1b2sieve? ( what kind of sieve files we got, or what type of prime we search) Thanks
These are primes of the form 2^n+c for variable n and c. The output file is ABC, which can be used with pfgw. I do not know if its ABC format is compatible with llr. When abs(c) > 1 the numbers will be PRP, unless small enough to be proven prime using other means.

 2022-03-22, 12:27 #619 pepi37     Dec 2011 After milion nines:) 32×173 Posts Is there any prime in that form exist?
2022-03-22, 14:02   #620
rogue

"Mark"
Apr 2003
Between here and the

2·32·7·53 Posts

Quote:
 Originally Posted by pepi37 Is there any prime in that form exist?
Mersenne Primes (when c = -1). Nothing for c = +1.

Almost all other PRPs cannot be proven prime with current hardware.

2022-03-22, 16:41   #621
chris2be8

Sep 2009

17×139 Posts

Quote:
 Originally Posted by rogue Nothing for c = +1.
Except for Fermat primes when n is a power of 2.

Most cases with abs(c) > 1 will be difficult to prove prime if they are large enough to be out of range of primo etc. Exceptions might be when c+/-1 is a power of 2 and the remainder after dividing out 2s has a lot of algebraic factors (or is a Mersenne prime).

 2022-05-14, 00:35 #623 pepi37     Dec 2011 After milion nines:) 32·173 Posts e:\PRIME>srsieve2 -P 50000000000000 -W 1 -w1e6 -L legend.txt -i t17_b10_k99999998.npg -o t17_b10_k99999998.npg -O fact999991.txt -f B srsieve2 v1.6.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with single sequence c=1 logic for p >= 110728654783 BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 1 base 10 sequence into 30 base 10^240 sequences. Fatal Error: Could not open Legendre file legend.txt\b10_k99999998_c-1.leg9999998) Last fiddled with by pepi37 on 2022-05-14 at 00:35
 2022-05-14, 06:22 #624 pepi37     Dec 2011 After milion nines:) 32×173 Posts e:\PRIME\srsieve2 -P 50000000000000 -W 6 -w1e7 -i sr_10.abcd -O factors.txt srsieve2 v1.6.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with multi-sequence c=1 logic for p >= 79917202699 BASE_MULTIPLE = 2, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Split 10 base 10 sequences into 27 base 10^144 sequences. Legendre summary: Approximately 4740 B needed for Legendre tables 10 total sequences 1 are eligible for Legendre tables 9 are not eligible for Legendre tables 1 have Legendre tables in memory 9 cannot have Legendre tables in memory 0 have Legendre tables loaded from files 1 required building of the Legendre tables 864000 bytes used for congruent subseq indices 12000 bytes used for congruent subseqs Sieve started: 79917202699 < p < 5e13 with 6902 terms (100005 < n < 999892, k*10^n+1) (expecting 1409 factors) And just exit , no sieve process started When I use old version of srsieve2 sieving process continue without any problem e:\PRIME\srsieve2 -P 20000000000000 -W 6 -w 5e6 -i sr_10.abcd -O factors.txt srsieve2 v1.5.3, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Cannot use Legendre tables because square-free part of k is too large Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 79917202700 Split 10 base 10 sequences into 14 base 10^96 sequences. Sieve started: 79917202700 < p < 2e13 with 6897 terms (100005 < n < 999892, k*10^n+1) (expecting 1244 factors) Last fiddled with by pepi37 on 2022-05-14 at 06:35 Reason: add more info
 2022-05-14, 13:09 #625 rogue     "Mark" Apr 2003 Between here and the 2×32×7×53 Posts Can you send me the file you are using? Also, you can use -l0 to use the generic logic for multiple sequences. It will be faster.
2022-05-14, 14:44   #626
pepi37

Dec 2011
After milion nines:)

155710 Posts

Quote:
 Originally Posted by rogue Can you send me the file you are using? Also, you can use -l0 to use the generic logic for multiple sequences. It will be faster.

https://www.dropbox.com/t/YD3zba2CafIGX80M

bat file, exe file and sieve file inside zip file :)

 2022-05-16, 14:42 #627 rogue     "Mark" Apr 2003 Between here and the 2·32·7·53 Posts There are two different bugs. Unfortunately I need to update gdb in my environment as it doesn't work with the newer gcc, but I'm getting errors when trying to update gdb and nothing I've tried (per google searches) has worked yet. Ugh!

All times are UTC. The time now is 00:50.

Mon Aug 8 00:50:30 UTC 2022 up 31 days, 19:37, 1 user, load averages: 1.15, 1.13, 1.06