Sierpinski number

From Example Problems
Jump to navigation Jump to search

In mathematics, a Sierpinski number is an odd natural number k such that integers of the form k2n + 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:

Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \left\{\,k 2^n + 1 : n \in\mathbb{N}\,\right\}}

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 is: "What is the smallest Sierpinski number?"

In 1962, John Selfridge proposed what is known as Selfridge's conjecture: that 78,557 was the answer to the Sierpinski problem. Selfridge found that when 78,557 was used as k in the equation, none of the numbers produced by the equation were prime. In other words, Selfridge demonstrated that 78,557 is a Sierpinski number.

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. As of 2005, all but eight of these numbers had been shown to produce primes, and were thus eliminated as possible Sierpinski numbers. Seventeen or Bust, a distributed computing project, is testing these remaining numbers. If the project finds that all of these numbers do generate a prime number when used as k, the project will have found a proof to Selfridge's conjecture.


See also

de:Sierpinski-Zahl fr:Nombre de Sierpinski it:Numero di Sierpinski ja:シェルピンスキー数 nl:Sierpinski-getal pl:Liczby Sierpińskiego