Pretend there exists a theorem along the lines of, if S is a Sierpinski number, then it has a covering set whose maximum value is bounded by some function B(S). Then, it would often be easy to disprove a certain number k from being a candidate Sierpinski number: find a composite k*2^n+1 whose smallest prime factor is larger than B(k).
No such theorem exists to my knowledge.
No comments :
Post a Comment