Hanoi tilings with a prescribed number of bottom squares

Primarily AI-generated textHuman understanding: all partsmath.CO — Combinatorics

Contributed by Will Howe ↗, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Version 1 / Nov 20, 2026 / CC BY 4.0

Abstract

For each fixed integer k≥2k\geq 2, every sufficiently large integer square admits a Hanoi tiling with exactly kk 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

OpenAI Codex drafted the manuscript and assisted with developing and checking the arguments. The supplementary files, where supplied, reproduce the stated computational checks.

References

  1. E. Friedman, Problem of the month, November 2003 , Math Magic, https://erich-friedman.github.io/mathmagic/1103.html original problem and previous constructions .link
  2. E. Friedman, Unsolved problems from Math Magic , questions 9 and 30, https://erich-friedman.github.io/mathmagic/unsolved.html problem list .link

Version history

  1. v1 · 2 pagesSubmitted by William HoweInitial depositCurrentNov 19, 2026