Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Is there an integer $m$ with $(m,6)=1$ such that none of $2^k3^\ell m+1$ are prime, for any $k,\ell\geq 0$?
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Positive odd integers $m$ such that none of $2^km+1$ are prime are called Sierpinski numbers - see [1113] for more details.

Erdős and Graham also ask more generally about $p_1^{k_1}\cdots p_r^{k_r}m+1$ for distinct primes $p_i$, or $q_1\cdots q_rm+1$ where the $q_i$ are primes congruent to $1\pmod{4}$. (Dogmachine has noted in the comments this latter question has the trivial answer $m=1$ - perhaps some condition such as $m$ even is meant.)

View the LaTeX source

This page was last edited 30 December 2025.

External data from the database - you can help update this
Formalised statement? Yes
Likes this problem None
Interested in collaborating None
Currently working on this problem uona
This problem looks difficult Dogmachine
This problem looks tractable None

Additional thanks to: Dogmachine and Wouter van Doorn

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #203, https://www.erdosproblems.com/203, accessed 2026-01-16