Erdős Problem #1113 — A positive odd integer such that none of are prime for is called a Sierpinski number.
A positive odd integer such that none of are prime for is called a Sierpinski number. We say that a set of primes is a covering set for if every is divisible by some . Are there Sierpinski numbers with no finite covering set of primes?
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.