Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
worm problem
|
| gptkbp:category |
covering problem
|
| gptkbp:citation |
Leo Moser, Canadian Mathematical Bulletin, 1966
Martin Gardner, Mathematical Games, Scientific American, 1967 |
| gptkbp:describes |
What is the region of smallest area that can accommodate every planar arc of length one?
|
| gptkbp:field |
gptkb:geometry
|
| https://www.w3.org/2000/01/rdf-schema#label |
Moser's worm problem
|
| gptkbp:minimumAreaKnown |
less than 0.2738
|
| gptkbp:minimumAreaLowerBound |
at least 0.2194
|
| gptkbp:openProblem |
true
|
| gptkbp:posedBy |
gptkb:Leo_Moser
|
| gptkbp:relatedShape |
convex region
|
| gptkbp:relatedTo |
universal covering problem
|
| gptkbp:yearProposed |
1966
|
| gptkbp:bfsParent |
gptkb:Leo_Moser
|
| gptkbp:bfsLayer |
6
|