20230404, 19:30  #1101 
"Mark"
Apr 2003
Between here and the
7,487 Posts 

20230404, 23:23  #1102  
Random Account
Aug 2009
Oceanus Procellarum
BE1_{16} Posts 
Quote:
I don't know how else to word this... 

20230405, 00:02  #1103  
"Gary"
May 2007
Overland Park, KS
12569_{10} Posts 
Quote:
Fbncsieve sieves a wide range of k. Srsieve2 sieves a wide range of n. Is that what you are asking? To answer your question: no. They are not equivalent. 3*2^100001 is not the same as 10000*2^31. I'm not sure why the question had to be asked. The calculator in Windows would have given the answer. Last fiddled with by gd_barnes on 20230405 at 00:08 

20230405, 00:46  #1104  
Random Account
Aug 2009
Oceanus Procellarum
3,041 Posts 
Quote:
I will let this go. It is not important. I was just goofing to pass some time. 

20230405, 04:04  #1105 
Jun 2003
1631_{10} Posts 

20230405, 12:40  #1106  
"Mark"
Apr 2003
Between here and the
1110100111111_{2} Posts 
Quote:
Both sieves sieve k*b^n+/1, but fbncsieve sieves for a fixed n and variable k (expressed as a range using k and K). srsieve2 sieves on variable n (expressed as a range using n and N) for one or more k (expressed as a sequence, e.g. k*b^n+/1) For srsieve2 n1e6 N2e6 means that variable n has a value between 1000000 to 2000000. For fbncsieve k1e6 K2e6 means that variable k has a value between 1000000 to 2000000. 

20230405, 13:18  #1107 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
23×271 Posts 
Is he referring to something like 1024*2^n1 == 2^(n+10)1 ?

20230405, 13:59  #1108  
Random Account
Aug 2009
Oceanus Procellarum
3,041 Posts 
Quote:
The highlighted above is exactly what I was looking for. Both are numerically weighted the same. It would appear that I was being ledbythenose years ago when I was told they were not. Many thanks, and apologies for the confusion! 

20230406, 17:04  #1109 
Random Account
Aug 2009
Oceanus Procellarum
3,041 Posts 
The error below happens with an inline series, but not with an "abcd" input file.
Example: Code:
fbncsieve k 3 K 1000000 p 3 P 1e10 W 6 s "k*1061955^6+1" o 1e10.abcd Code:
fbncsieve v1.6, a program to find factors of k*b^n+c numbers for fixed b, n, and c and variable k Sieve started: 3 < p < 1e10 with 499999 terms (3 < k < 1000000, k*1061955^6+1) (expecting 476143 factors) Increasing worksize to 400000 since each chunk is tested in less than a second Increasing worksize to 10000000 since each chunk is tested in less than a second Increasing worksize to 50000000 since each chunk is tested in less than a second Sieve completed at p=10171501019. CPU time: 52.31 sec. (2.78 sieving) (4.89 cores) Fatal Error: Something is wrong. Counted terms (26337) != expected terms (26336) Sorry! 
20230406, 17:14  #1110  
"Mark"
Apr 2003
Between here and the
16477_{8} Posts 
Quote:


20230407, 15:19  #1111 
"Mark"
Apr 2003
Between here and the
7,487 Posts 
