|Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).|
PrimeGrid Prime Sierpiński Problem
The Sierpiński problem is attempting to prove that k = 78557 is the smallest Sierpiński number. However, 78557 itself is not a prime number.
The Prime Sierpiński Problem wants to find the smallest Sierpiński number that is also a prime number. The smallest known number that meets these conditions is k = 271129. To prove that 271129 is the smallest prime Sierpiński number, all prime values of k < 271129 must be shown to produce a prime number of the form k•2n+1.
History of eliminated candidates
- 2017-09-17: 168451•219375200+1
- 2016-10-31: 10223•231172165+1, eliminating k = 10223 from both the Sierpiński and Prime Sierpiński problems.