Smallest Sierpiński number
Is 78,557 the smallest odd number k for which k·2^n + 1 is composite for every n?
Summary
Wacław Sierpiński proved in 1960 that infinitely many such numbers exist, and John Selfridge showed in 1962 that 78,557 is one; Selfridge conjectured that it is the smallest. Proving this needs a prime of the form k·2^n + 1 for every smaller odd k, the goal of a distributed volunteer computing search.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.