  In 1960, W. Sierpinski proved that there are infinitely many positive odd
numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a
composite number. Such numbers are called "Sierpinski numbers". In this study,
by using covering systems and the theory of cyclotomic polynomials, the
following theorem is proved: for any integer $m>1$, there are infinitely many
integers $k$ satisfying $k\not\equiv-1\!\pmod{q}$ for any prime number
$q|(m-1)$, such that for any positive integer $n$, $km^n+1$ is a composite
number. These positive integers $k$ are called "Sierpinski numbers based $m$".
The theorem can be regarded as a generalization of Sierpinski problem.
