20200707, 15:18  #12  
"Mark"
Apr 2003
Between here and the
3^{2}·5^{2}·29 Posts 
Quote:
I'm trying to understand your goal. Are you trying to find the smallest n that yields an SG prime for each k? I was thinking of the search over at PrimeGrid where they are searching for SG primes with a specific bit length (or small range of them). gfndsieve is the best sieve for b=2 and c=+1 as it sieves for a range of n and k. One could let it sieve to some prime to eliminate SG candidates because k*2*n+1 has a factor. One could then manipulate the output file with a script to convert k and n (for 2*(k*2^n+1)1) then rerun gfndsieve starting at p=3. When done, convert k and n back. 

20200707, 15:46  #13  
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
Quote:
Yes, I'm trying to find a SG prime for each k not yet having one. Since there is 32 k's remaining, they just like srbase does, have to be fixed, while the n range covers a lot of n. It seems sound, what you suggest, but it still doesn't remove the n's that are looners and maintain in the output file or am I missing something (most likely)? 

20200707, 16:39  #14  
"Mark"
Apr 2003
Between here and the
1100101111101_{2} Posts 
Quote:
I just need the input files that are causing it to crash. Please post them here or send a link via email or PM so that I can determine if the current version has the issue. 

20200707, 17:55  #15 
"Jeppe"
Jan 2016
Denmark
2^{4}·11 Posts 
What are the size of the 32 k values? What k do you consider; the odd multiples of 3?
PrimeGrid has used TwinGen (it seems) to sieve for a fixed n. Their aim has been to find the largest Sophie Germain primes (and they have succeeded). EDIT: Sorry, I see the complete explanation in the page linked from the first post above, so forget my questions. /JeppeSN Last fiddled with by JeppeSN on 20200707 at 17:58 
20200707, 18:08  #16 
"Mark"
Apr 2003
Between here and the
6525_{10} Posts 
You can find twingen/twingenx here: http://www.underbakke.com/primes/

20200708, 15:37  #17  
Quasi Admin Thing
May 2005
2^{2}×3^{5} Posts 
Quote:
Sequence file is: Klist.txt (contains 32 k's remaining for SG conjecture  should be attached) srsieve2 is version 1.1 and is started using following entry in commandprompt: srsieve2 P 10e9 W 4 w 10000000 s"Klist.txt" n 1 N 100e6 It starts well, but at unknown point it starts taking up almost 4 GB of RAM, short before the final mod error message... the data from commandprompt is here: Sieving with generic logic Sieve started: 2 < p < 1e10 with 3200000000 terms (1 < n < 100000000, k*2^n+c) (expecting 3103670401 factors) p=109, 0.262 p/sec, 2298312447 factors found at 3.571M f/sec, 0.0% done. 39*2^31 is prime! p=389, 0.787 p/sec, 2477042934 factors found at 3.464M f/sec, 0.0% done. ETC 26191127 03:30 279*2^11 is prime! 351*2^11 is prime! 387*2^11 is prime! 399*2^11 is prime! Sieving with generic logic Split 32 base 2 sequences into 4149 base 2^360 sequences. Fatal Error: 387*2^252061 mod 809 = 297ctors found at 3.101M f/sec, 0.0% done. The exact same happens, if I use a deeper sieved .abcd file. It starts and then stacks a lot of RAM before exiting with a mod error :( It should not be on your top priority list to make a new siever, since I have gotten something working in regard of testing the n<=100M range for the 32 k's for SG, using sr2sieve, but for the future users it sure would save them some troubles if there were a dedicated siever made for variable n and various amounts of fixed k's sieving for SG. 

20200708, 16:27  #18  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7·457 Posts 
Quote:


20200718, 23:54  #19  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7×457 Posts 
Quote:
of candidates to not include n for which there is some prime p dividing gcd(k+1,b1) for which p dividing (k*b^n+1)/gcd(k+1,b1) (like we can initialized the list of candidates to not include n for which k*b^n+1 has algebra factors, e.g. for square k's for k*b^n1, we can remove all even n in the sieve file, and for cube k's for k*b^n1 and k*b^n+1, we can remove all n divisible by 3 in the sieve file) However, I only did the first step (sieve the sequence k*b^n+1 for primes p not dividing gcd(k+1,b1)), like my sieve files for R36, SR46, and SR58, e.g. for R36 ((k*36^n1)/gcd(k1,361)) I sieved start with the prime 11, since we should not sieve the primes 5 and 7, I do not know how to remove the n's with a given property, I want to know how you remove the n for which k*b^n+1 has algebra factors, e.g. remove all n divided by 4 from the sieve file of S230 k=4, I can also use this way to remove n for which there is some prime p dividing gcd(k+1,b1) for which p dividing (k*b^n+1)/gcd(k+1,b1) Last fiddled with by sweety439 on 20200718 at 23:59 

20200720, 22:15  #20 
Mar 2006
Germany
B71_{16} Posts 
There're two problems with the example of 13*43^n1:
1. All candidates are divisible by 6. 2. The smallest pvalue to start with srsieve is p=44, so have to be greater than the base. What I did:  looking the factorizations of the first values of (13*43^n1)/6  every n==0 mod 2 has factor 2  every n==1 mod 3 has factor 3  every n==3 mod 4 has factor 5  every n==6 mod 8 has factor 17  every n==1 mod 30 has factor 31  every n==6 mod 22 has factor 23 Using awk with this: Code:
BEGIN {print "44:M:1:43:258" >"t.txt" n=1 while (n < 1000000) { if (n % 2 == 0) {} # factor 2 else if (n % 3 == 1) {} # factor 3 else if (n % 4 == 3) {} # factor 5 else if (n % 8 == 6) {} # factor 17 else if (n % 30 == 1) {} # factor 31 else if (n % 22 == 6) {} # factor 23 else print "13 "n >>"t.txt" n++ } } Code:
44:M:1:43:258 13 5 13 9 13 17 13 21 13 29 13 33 13 41 13 45 13 53 13 57 (...) Use sr1sieve on this to higher P. Changing the header after sieve to Code:
ABC ($a*43^$b1)/6 13 41 13 101 13 149 13 165 13 173 13 185 13 233 (..) I got ~26,000 candiates left (don't know the exact Pvalue, was only a quick test). 
20200720, 22:18  #21 
May 2007
Kansas; USA
2·3·5·353 Posts 
OK so (13*43^n1)/2 is a bad example.
A better example is (13*51^n1)/2 Regardless we want srsieve to do this. Removing the error check from srsieve is the easiest way for the layman. 
20200721, 03:23  #22  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
7×457 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
List of proven/1k/2k/3k conjectures  The Carnivore  Conjectures 'R Us  84  20181206 09:34 
Conjectures with one k remaining  rogue  Conjectures 'R Us  109  20170429 01:28 
Deligne's work on the Weil conjectures  intrigued  Math  1  20110219 11:30 
Conjectures 'R Us; searches needed  gd_barnes  Conjectures 'R Us  41  20080118 21:47 
Poll on direction of conjectures effort  gd_barnes  Conjectures 'R Us  2  20071219 18:15 