Statements (11)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
odd numbers k such that k·2^n + 1 is composite for all n ≥ 1
|
| gptkbp:field |
number theory
|
| gptkbp:firstPosed |
1960
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sierpinski problem
|
| gptkbp:namedAfter |
gptkb:Wacław_Sierpiński
|
| gptkbp:notableAchievement |
78557 is the smallest known Sierpinski number
|
| gptkbp:relatedTo |
gptkb:Sierpinski_number
|
| gptkbp:status |
partially solved
|
| gptkbp:bfsParent |
gptkb:Willem_Sierpinski
|
| gptkbp:bfsLayer |
7
|