
Glossary: Prime Pages: Top 5000: 
A Sierpinski number is a positive, odd integer
k for which the integers
k^{.}2^{n}+1
are all composite (that is, for every
positive integer n). In 1960
Sierpinski showed that there were infinitely many such
numbers k (all solutions to a family of congruences),
but he did not explicitly give a numerical example.
The congruences provided a sufficient, but not
necessary, condition for an integer to be a Sierpinski
number. Of course Sierpinski also asked what the
smallest such number might bedetermining this
number is called the Sierpinski problem.
If the congruences proposed by Sierpinski are solved, a 19digit number k is obtained as their smallest solution. The much smaller example k = 78557, now conjectured to be the smallest Sierpinski number, was found by John Selfridge in 1962. This is a Sierpinski number because it has the "covering set:" {3, 5, 7, 13, 19, 37, 73} Why call this a covering set? Because every number of the form 78557^{.}2^{n}+1 is divisible by one of these small primes. So these seven primes cover every possible case!
It is conjectured that 78557 is the smallest Sierpinski number because for most of the smaller numbers we can easily find a prime (in fact, for about 2/3rds of the numbers k there is a prime with n less than 9). The rest were then checked for small covering sets and none were found, so we expect to find a prime for the remaining forms. To prove the Sierpinski conjecture, "all" you need to do is: for each of the following values of k, find an exponent n which makes k^{.}2^{n}+1 prime (for that particular value of k): 10223, 21181, 22699, 24737, 55459, and 67607.Showing whether the list above is complete or not will take much more of this same type of prime finding. The most recent and spectacular success on the Sierpinski problem is by the "Seventeen or Bust" project which has recently found primes for the multipliers 4847, 5359, 19294, 27653, 28433, 33661, 44131, 46157, 54767, 65567, and 69109! The prime they found for 19249 has 3,918,990 digits. It is expected that the primes for the last few multipliers will be very very large. In 1956 Riesel studied the corresponding problem for numbers of the form k^{.}2^{n}1 (see Riesel numbers).
See Also: RieselNumber Related pages (outside of this work)
References:
Chris K. Caldwell © 19992015 (all rights reserved)
