Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
odd k such that k*2^n-1 is composite for all n>1
|
| gptkbp:field |
number theory
|
| gptkbp:firstDescribed |
1956
|
| gptkbp:hasConjecture |
509203 is the smallest Riesel number
|
| https://www.w3.org/2000/01/rdf-schema#label |
Riesel problem
|
| gptkbp:namedAfter |
gptkb:Hans_Riesel
|
| gptkbp:numberInSeries |
gptkb:OEIS:A059968
|
| gptkbp:openQuestion |
Are there smaller Riesel numbers than 509203?
|
| gptkbp:relatedTo |
gptkb:Riesel_number
gptkb:Sierpinski_problem |
| gptkbp:smallest_known_Riesel_number |
509203
|
| gptkbp:status |
partially solved
|
| gptkbp:bfsParent |
gptkb:Riesel_number
|
| gptkbp:bfsLayer |
7
|