Sierpinski number
Sierpinski number is a number k which k*2^n+1 is composite with all n.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2569154574
- Described as
- number k which k*2^n+1 is composite with all n
- What it is
- mathematical concept
- Named after
- Wacław Sierpiński
- Wikipedias with a page
- 20
Wikidata item Q547430 (wikidata.org/wiki/Q547430), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1381802885
In number theory, a Sierpiński number is an odd natural number k such that k×2n+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:{k⋅2n+1:n∈ℕ}.
If the form is instead k×2n−1, then k is a Riesel number.
From the Wikipedia article “Sierpiński number” (en.wikipedia.org/wiki/Sierpiński_number), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
