20051229, 07:45  #1 
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Sieving multiple NewPGen files in a row(How?)
I'm trying to find all primes for the main k/n pairs at Riesel Sieve, but, because of something I believe I've heard about finding primality(I'm not going to quote because I may be wrong), I'm trying to find primes for all the remaining k for n*k^21 (not a typo).
I've heard(possibly incorrectly) that it is conjectured that if one form(k*2^n1) is found prime, than the other form(n*2^k1) also has a prime, and viceversa. Which leads me to my question. Because some of these k take longer than others in this form, is it possible to set criteria for sieving multiple ks in NewPGen(one after the other), then just let it go? 
20051229, 08:30  #2 
Jun 2003
4,969 Posts 
I think the form you are looking for is 2^nk. You can do a Google search for "Dual Sierpinski problem" to find more details.
NewPGen supports the sieving of b^n+/k with fixed k. As for sieving multiple k's one after the other, I think you should be able to use the "Sieve Until..." Option. Here you can set stop criteria for how far to sieve a single k, and the increment the k and move on. You might also want to look at PFGW for such things, since you'll also be able to test the candidates for primality. 
20051229, 08:40  #3  
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Quote:
Also, because of the nature of the problem I decided to undertake, I can't simply increment the kvalue by an amount, unless I'm satisfied with 2 ks at a time. I appreciate your attempt to help me, though. 

20051229, 08:58  #4  
Jun 2003
4,969 Posts 
Quote:
At any rate, I highly doubt it if the conjucture is true! All you have to do is find a prime of the form x*2^5092031 for some x. By the conjucture, you will expect to have a prime 509203*2^x1. Unfortunately, since 509203 is a Riesel number, there won't be any such primes. Am I getting close? Last fiddled with by axn on 20051229 at 08:58 

20051229, 09:30  #5  
"Jason Goatcher"
Mar 2005
110110110011_{2} Posts 
Quote:
I'm not saying it's true, I'm just going by what B2(the runner of Riesel Sieve) told me, and he indicated it was just a conjecture. Last fiddled with by jasong on 20051229 at 09:31 

20051229, 09:43  #6  
Jun 2003
11551_{8} Posts 
Quote:
n*k^21 n*2^k1 n*k^n1 Which is the form that is needed to have a prime? The last one is called Generalized Woodall primes  I think it can be sieved by multisieve. Last fiddled with by axn on 20051229 at 09:44 

20051229, 09:49  #7  
"Jason Goatcher"
Mar 2005
3×7×167 Posts 
Quote:


20051229, 10:01  #8  
Jun 2003
4969_{10} Posts 
Quote:
Is there some conditions for this conjecture, like we should consider only the Riesel k's? 

20051229, 10:15  #9  
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Quote:
Do you believe you can find an n that causes n*2^5092031 to be prime? Last fiddled with by jasong on 20051229 at 10:15 

20051229, 12:22  #10  
7×953 Posts 
sieving
Quote:
Ranges can be set in the WorkToDo.txt. It uses a five stage loop procedure, with optional sieving stop points. Any or all of the following: You can stop at a maximum bound p. You can also stop at a particular elimination rate. You can also stop at a certain processor time total. Later versions will be able to script a custom set of ranges. For now you must manually enter parameters for a sequence. 

20051229, 16:25  #11  
Jun 2003
4,969 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Choosing Between Multiple Poly Files  EdH  Msieve  10  20180315 03:16 
Question: Multiple sequences in NewPGen format  Xentar  Conjectures 'R Us  3  20080120 15:56 
Combining NewPGen files?  roger  Riesel Prime Search  4  20080115 00:01 
Need to learn how to edit, and make from scratch, NewPGen files.  jasong  Software  2  20060528 21:16 
Sieving with NewPGen  Cruelty  15k Search  41  20051027 10:28 