Sierpinski number

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In number theory, a Sierpinski or Sierpiński number is an odd natural number k such that k2n + 1 is composite, for all natural numbers n. In 1960, Wacław Sierpiński proved that there are infinitely many odd integers k which have this property.

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

\left\{\,k 2^n + 1 : n \in\mathbb{N}\,\right\}.

Numbers in such a set with odd k and k < 2n are Proth numbers.

Known Sierpiński numbers[edit]

The sequence of currently known Sierpiński numbers begins with:

78557, 271129, 271577, 322523, 327739, 482719, 575041, 603713, 903983, 934909, 965431, … (sequence A076336 in OEIS).

The number 78557 was proved to be a Sierpiński number by John Selfridge in 1962, who showed that all numbers of the form 78557·2n+1 have a factor in the covering set {3, 5, 7, 13, 19, 37, 73}. For another known Sierpiński number, 271129, the covering set is {3, 5, 7, 13, 17, 241}. All currently known Sierpiński numbers possess similar covering sets.[1]

The Sierpiński problem[edit]

Further information: Seventeen or Bust
List of unsolved problems in mathematics
Is 78,557 the smallest Sierpiński number?

The Sierpiński problem is: "What is the smallest Sierpiński number?"

In 1967, Sierpiński and Selfridge conjectured that 78,557 is the smallest Sierpiński number, and thus the answer to the Sierpiński problem.

To show that 78,557 really is the smallest Sierpiński number, one must show that all the odd numbers smaller than 78,557 are not Sierpiński numbers. That is, for every odd k below 78,557 there exists a positive integer n such that k2n+1 is prime.[1] As of December 2013, there are only six candidates:

k = 10223, 21181, 22699, 24737, 55459, and 67607

which have not been eliminated as possible Sierpiński numbers.[2] Seventeen or Bust (with PrimeGrid), a distributed computing project, is testing these remaining numbers. If the project finds a prime of the form k2n+1 for every remaining k, the Sierpiński problem will be solved.

Since the second proved Siepinski number is 271129, the unknown values of k between 78557 and 271129 are

79309, 79817, 91549, 99739, 131179, 152267, 156511, 161041, 163187, 168451, 193997, 200749, 202705, 209611, 222113, 225931, 227723, 229673, 237019, 238411

The smallest n for which k×2n+1 is prime[edit]

0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 2, 1, 1, 0, 3, 0, 6, 1, 1, 0, 1, 2, 2, 1, 2, 0, 1, 0, 8, 3, 1, 2, 1, 0, 2, 5, 1, 0, 1, 0, 2, 1, 2, 0, 583, 1, 2, 1, 1, 0, 1, 1, 4, 1, 2, 0, 5, 0, 4, 7, 1, 2, 1, 0, 2, 1, 1, 0, 3, 0, 2, 1, 1, ... (sequence A040076 in OEIS) or OEISA078680 (not allow that n = 0), for odd ks, see OEISA046067 or OEISA033809 (not allow that n = 0).

The first three k such that the kth term of this sequence is not defined are conjectured to be 78557, 157114 and 271129.

For more terms k ≤ 1200, see [1] (k≤300), [2] (301≤k≤600), [3] (601≤k≤900), and [4] (901≤k≤1200).

Simultaneously Sierpiński and Riesel[edit]

A number may be simultaneously Sierpiński and Riesel. These are called Brier numbers. The smallest five known example are 3316923598096294713661, 10439679896374780276373, 11615103277955704975673, 12607110588854501953787, 17855036657007596110949, ... (A076335).[3]

The dual Sierpinski problem[edit]

The dual Sierpinski numbers are defined as an odd natural number k such that 2n + k is composite for all natural number n, there is a conjecture that the set of this numbers is the same as the set of Sierpinski numbers, for example, 2n + 78557 is composite for all natural number n, and 78557 was proven to be the smallest dual Sierpinski number.

The least n such that 2n + k is prime are (for odd ks)

1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 2, 1, 1, 4, 2, 1, 2, 1, 1, 2, 1, 5, 2, 1, 3, 2, 1, 1, 8, 2, 1, 2, 1, 1, 4, 2, 1, 2, 1, 7, 2, 1, 3, 4, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 7, 4, 5, 3, 4, 2, 1, 2, 1, 3, 2, 1, 1, 10, 3, 3, 2, 1, 1, ... (sequence A067760 in OEIS)

There are no unknown terms below 78557, so 78557 is proved to be the smallest dual Sierpinski number. However, some values of ns are large, for example, the smallest solution for that k = 2131, 40291, and 41693, the least n are 4583176, 9092392, and 5146295. (However, the least n such that k2n + 1 is only 44, 8, and 33. Interestingly, the least n which 2n + 10223 is prime is only 19.)

The odd ks which 2n + k are composite for all n < k are

773, 2131, 2491, 4471, 5101, 7013, 8543, 10711, 14717, 17659, 19081, 19249, 20273, 21661, 22193, 26213, 28433, ... (sequence A033919 in OEIS)

There is also a "five or bust", similar to seventeen or bust, considers this problem, and found primes for all ks < 78557, so it is currently known that 78557 is the smallest dual Sierpinski number.

The Sierpinski function is k2n + 1, in fact, it can be also defined for all odd integer k and all integer n (n does not equal to 0), both of them can be either positive or negative; if we let n negative, the function will become \frac{2^{-n} + k}{2^{-n}}, if we choose the numerator of it, it will be 2-n + k, or the dual Sierpinski function; if we let k negative, the function will become -((-k)2n - 1), if we choose the absolute of it, it will be (-k)2n - 1, or the Riesel function; if we let both k and n negative, the function will become -\frac{2^{-n} - (-k)}{2^{-n}}, if we choose the absolute of the numerator of it, it will be |2-n - (-k)|, or the dual Riesel function, so we can define a function \Xi(k, n) = abs(numerator(k2^n+1)) for all odd integer k and all integer n (n does not equal to 0), both of them can be either positive or negative, and we can find all ns which \Xi(k, n) is prime for an odd integer k. However, there is still no primes for which k = 78557, 271129, -509203, etc. There is a conjecture that all such numbers have a covering set, but it is false to some perfect power numbers, and there is still a conjecture that all such numbers which are not perfect power numbers have a covering set.

See also[edit]

References[edit]

Further reading[edit]

External links[edit]