Hanoi tilings with a prescribed number of bottom squares
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
For each fixed integer , every sufficiently large integer square admits a Hanoi tiling with exactly squares on its bottom edge. We construct nearly equal columns from two coprime widths and prove a rectangle lemma to fill their remaining height.
Provenance statement
References
- E. Friedman, Problem of the month, November 2003 , Math Magic, https://erich-friedman.github.io/mathmagic/1103.html original problem and previous constructions .link
- E. Friedman, Unsolved problems from Math Magic , questions 9 and 30, https://erich-friedman.github.io/mathmagic/unsolved.html problem list .link
Version history
- v1 · 2 pagesSubmitted by William HoweInitial depositCurrentNov 19, 2026