20201129, 20:52  #1 
Dec 2011
After milion nines:)
2^{4}×89 Posts 
low nash base 10 sequence
On Kamada page the is huge number of low nash base 10 sequences ( plus or minus side) Even with very small sieve depth I can remove many candidates, but I would like to do sieve to at least 1e14. And then I have problem since sr2sieve cannot do such depth on sequence like this 5539879179*10^n+1.
So does anyone here have some simpler solution except sieving one by one with srsieve and sr1sieve? Update: for now srsieve2 is also in game (and since it is MT) it is fast solution :) Last fiddled with by pepi37 on 20201129 at 21:31 
20201130, 08:23  #2  
Nov 2016
2,819 Posts 
Quote:


20201130, 22:40  #3  
Dec 2011
After milion nines:)
2^{4}×89 Posts 
Quote:
Sweety439, with all due respect , I didnot ask clarification of my problem ( since I also know sr2sieve doesnot working) I ask any "elegant" solution for my problem. 

20201203, 04:52  #4 
Jun 2003
1,579 Posts 
srsieve can handle multiple base 10 sequences at once.
eg) srsieve.exe pfgw nmin 1 nmax 10000 pmin 1 pmax 10000 factors "3*10^n+1" "2*10^n1" 
20201203, 08:44  #5 
Dec 2011
After milion nines:)
2^{4}×89 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Nash value of exponent  pepi37  Math  2  20180909 04:56 
Nash value  pepi37  Math  0  20180323 21:27 
Nash weight of base 17  pepi37  Riesel Prime Search  18  20140204 23:42 
Nash Weights vs. Sievability  LiquidNitrogen  Information & Answers  7  20110803 03:06 
How to calculate Nash/robinson weight?  cipher  No Prime Left Behind  6  20090509 15:35 