Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
gptkb:infinite_binary_tree |
| gptkbp:describes |
enumeration of positive rational numbers
|
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:hasNode |
rational number
|
| gptkbp:introducedIn |
2000
|
| gptkbp:inventedBy |
gptkb:Herbert_Wilf
gptkb:Neil_Calkin |
| gptkbp:leftChildRule |
n/d → n/(n+d)
|
| gptkbp:numberInSeries |
gptkb:Calkin–Wilf_sequence
|
| gptkbp:property |
every positive rational number appears exactly once
tree is binary tree is complete tree is infinite tree is ordered tree is rooted |
| gptkbp:publishedIn |
gptkb:Mathematics_Magazine
|
| gptkbp:relatedTo |
gptkb:tree
gptkb:Farey_sequence gptkb:Stern–Brocot_tree enumeration of rationals |
| gptkbp:rightChildRule |
n/d → (n+d)/d
|
| gptkbp:rootNode |
1/1
|
| gptkbp:bfsParent |
gptkb:Stern–Brocot_tree
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Calkin–Wilf tree
|