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:firstPublished |
1960
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sierpiński problem
|
| gptkbp:namedAfter |
gptkb:Wacław_Sierpiński
|
| gptkbp:relatedTo |
gptkb:Sierpiński_number
|
| gptkbp:solvedBy |
There exist infinitely many odd integers k such that k·2^n+1 is composite for all n ≥ 1
|
| gptkbp:status |
solved
|
| gptkbp:bfsParent |
gptkb:Wacław_Sierpiński
|
| gptkbp:bfsLayer |
5
|