Data structureadvanced
Calkin-Wilf tree
An infinite binary tree containing every positive rational exactly once in lowest terms, with children of a/b being a/(a+b) and (a+b)/b.
An infinite binary tree containing every positive rational exactly once in lowest terms, with children of a/b being a/(a+b) and (a+b)/b.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag R06GGM Edit this page History Report an error