As proved by Sierpiński (1960), there exist infinitely many positive odd numbers such that
is composite
for every
. Numbers
with this property are called Sierpiński
numbers of the second kind, and analogous numbers with the plus sign replaced
by a minus are called Riesel numbers. It is conjectured
that the smallest value of
for a Sierpiński
number of the second kind is
(although a handful of smaller candidates remain to
be eliminated) and that the smallest Riesel number
is
.
Sierpiński's Composite Number Theorem
See also
Cunningham Number, Proth Number, Proth Prime, Riesel Number, Sierpiński Number of the Second Kind, Sierpiński's Prime Sequence TheoremExplore with Wolfram|Alpha
References
Ballinger, R. "The Riesel Problem: Definition and Status." http://www.prothsearch.net/rieselprob.html.Ballinger, R. "The Sierpinski Problem: Definition and Status." http://www.prothsearch.net/sierp.html.Ballinger, R. and Keller, W. "The Riesel Problem: Search for Remaining Candidates." http://www.prothsearch.net/rieselsearch.html.Buell, D. A. and Young, J. "Some Large Primes and the Sierpiński Problem." SRC Tech. Rep. 88004, Supercomputing Research Center, Lanham, MD, 1988.Helm, L. and Norris, D. "Seventeen or Bust: A Distributed Attack on the Sierpinski Problem." http://www.seventeenorbust.com/.Jaeschke, G. "On the SmallestReferenced on Wolfram|Alpha
Sierpiński's Composite Number TheoremCite this as:
Weisstein, Eric W. "Sierpiński's Composite Number Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SierpinskisCompositeNumberTheorem.html