Sierpinski number.html



In number theory, a Sierpinski number is an odd natural number k such that integers of the form k2ⁿ + 1 are composite (i.e. not prime) for all natural numbers n.

In other words, when k is a Sierpinski number, all members of the following set are composite:

Numbers in this set with odd k and k < 2ⁿ are called Proth numbers.

In 1960 Wacław Sierpiński proved that there are infinitely many odd integers that when used as k produce no primes.

The Sierpinski problem

Unsolved problems in mathematics: Is 78,557 the smallest Sierpinski number?

The Sierpinski problem is: "What is the smallest Sierpinski number?"

In 1962, John Selfridge proved that 78,557 is a Sierpinski number; he showed that, when k=78,557, all numbers of the form k2ⁿ+1 have a factor in the covering set {3, 5, 7, 13, 19, 37, 73}.

In addition, in 1967, Sierpiński and Selfridge proposed (but could not prove) the conjecture that 78,557 is the smallest Sierpinski number, and thus the answer to the Sierpinski problem.

To show that 78,557 really is the smallest Sierpinski number, one must show that all the odd numbers smaller than 78,557 are not Sierpinski numbers. That is, there exists an n such that k2ⁿ+1 is prime.[1] As of November 2007, there are only six candidates which have not been eliminated as possible Sierpinski numbers.[2] Seventeen or Bust, a distributed computing project, is testing these remaining numbers.

If the project finds a prime of the right form for all the remaining k, the Sierpinski problem will be solved.

Current status

As of September 2008, the following k have been solved by Seventeen or Bust.

See also

Mathematics portal

• Riesel number

References

• Richard K. Guy (2004). Unsolved Problems in Number Theory. Springer-Verlag. p. 120. ISBN 0-387-20860-7. 

External links

• Sierpinski number at The Prime Glossary
• The Sierpinski problem: definition and status
• Sierpinski's Composite Number Theorem at MathWorld
• The Prime Sierpinski Problem, a related question.