Some notes from unpublished work by Prof Caldwell
Definition of a Sierpinski number
An integer k > 1 is a Sierpinski number base b if gcd(k+1,b1) = 1 and
k.bn+1 is composite for all n > 0.
• gcd(k+1,b1) = 1 avoids trivial covers (1covers).
• k > 1 avoids leading Generalized Fermat divisors. (May use Strong Sierpinski for GFN’s included, and may toss out further GFN’s in the weak case above.)
• n > 0 avoids removing k = p1 as a multiplier for all primes p and all bases b. (Shouldn’t b be involved in the choice of k?)
