Hanoi tilings with a prescribed number of bottom squares
Source: hexagonmath.org/abs/2611.00683v1
For each fixed integer $k\geq 2$, every sufficiently large integer square admits a Hanoi tiling with exactly $k$ squares on its bottom edge. We construct nearly equal columns from two coprime widths and prove a rectangle lemma to fill their remaining height.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00683
curl -X POST /api/v1/records/hexagon/2611.00683/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00683/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'