- The Sierpinski conjecture deals with n>=+1, presumably because k
(odd).2^0+1 is always composite.
(see http://planetmath.org/encyclopedia/SierpinskiConjecture.html )
However, if I am dealing with base 5 instead of base 2, is it
reasonable to deal with n=0, given that k(even).5^0+1 is odd, and