![]() |
|
|
#1 |
|
Dec 2011
After milion nines:)
5×172 Posts |
We all know there is k ( on any base) that can have low nash value or high nash value.
When I start searching prime in fixed exponent type, I also noticed some exponent have on same k range little more exponent that survive sieve from another. But difference is small , maybe ( or max) 2-3%. So if someone here know the answer: is on any base some exponent that will produce significant lower sieve files, or will every be case Iike I observed. And of course, if such exponent exist, how to compute more of them. Thanks! |
|
|
|
|
|
#2 |
|
Jun 2003
2×7×113 Posts |
For k*b^n+-1, I think you are talking about fixed b and n and variable k?
Some of this is randomness involved with distribution of factors. When n has a lot of small factors and k is a power then they could have a factor. e.g. 4*5^10-1 will have factors 2*5^5+1 and 2*5^5-1 |
|
|
|
|
|
#3 |
|
Jun 2003
5,051 Posts |
The short answer is no. Except for minor statistical noise, there is not going to be meaningful difference between different exponents.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Nash value | pepi37 | Math | 0 | 2018-03-23 21:27 |
| Nash weight of base 17 | pepi37 | Riesel Prime Search | 18 | 2014-02-04 23:42 |
| John Nash's letter to the NSA predecessors | Christenson | Math | 10 | 2012-02-25 16:39 |
| Nash Weights vs. Sievability | LiquidNitrogen | Information & Answers | 7 | 2011-08-03 03:06 |
| How to calculate Nash/robinson weight? | cipher | No Prime Left Behind | 6 | 2009-05-09 15:35 |