Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:defines |
an odd natural number k such that k·2^n + 1 is composite for all natural numbers n
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sierpinski number
|
| gptkbp:namedAfter |
gptkb:Wacław_Sierpiński
|
| gptkbp:notableExample |
78557
|
| gptkbp:openProblem |
gptkb:Sierpinski_problem
|
| gptkbp:relatedTo |
gptkb:Riesel_number
prime numbers covering set |
| gptkbp:sequence |
infinite sequence
|
| gptkbp:bfsParent |
gptkb:Riesel_number
gptkb:Willem_Sierpinski |
| gptkbp:bfsLayer |
7
|