\documentclass[11pt,letterpaper,twoside,reqno]{amsart} \usepackage[T1]{fontenc} \usepackage{lmodern,amsmath,amssymb,booktabs,graphicx} \usepackage[margin=1in]{geometry} \usepackage[hidelinks,unicode]{hyperref} \hypersetup{pdftitle={Hanoi tilings with a prescribed number of bottom squares}, pdfauthor={Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer}, pdfsubject={Mathematical research note},pdfkeywords={Hanoi tiling, square dissection, Chinese remainder theorem}} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newcommand{\topic}[2]{\section{#2}\label{r#1}} \newcommand{\src}[2]{\href{#1}{#2}} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\ord}{\operatorname{ord}} \newcommand{\dd}{\mathop{}\!\mathrm d} \newcommand{\stir}[2]{\genfrac{[}{]}{0pt}{}{#1}{#2}} \title[Hanoi square tilings]{Hanoi tilings with a prescribed number of bottom squares} \author[W. Howe]{Will Howe} \author[G. Huffman]{Grant Huffman} \author[J. Kohlmeyer]{Jensen Kohlmeyer} \author[L. Kruer]{Liam Kruer} \date{November 19, 2026} \subjclass[2020]{05B45} \keywords{Hanoi tiling, square dissection, Chinese remainder theorem} \thanks{The authors acknowledge assistance from OpenAI Codex in mathematical exploration, checking, and manuscript preparation. OpenAI Codex drafted the proof and ran the accompanying checks.} \begin{document} \begin{abstract} For each fixed integer \(k\ge2\), every sufficiently large integer square admits a Hanoi tiling with exactly \(k\) squares on its bottom edge. We build nearly equal columns from two coprime widths and prove a rectangle lemma that fills the remaining height. \end{abstract} \maketitle \section{A tiling for each sufficiently large square} \begin{theorem}For every fixed integer \(k\ge2\), every sufficiently large integer square has a tiling by integer-sided squares with exactly \(k\) on the bottom. The entire lower edge of every other tile rests on strictly larger tiles. \end{theorem} \begin{proof}Take relatively prime squarefree \(D,E\) with \(\sigma(d)>kd\) for \(d=D,E\), where \(\sigma\) is the sum of positive divisors. Indeed, the divergence of \(\sum_p1/p\) lets us select two disjoint finite sets of primes with \(\prod_p(1+1/p)>k\) in each. Their respective prime products work. For each \(d\) list the divisors \(d=t_1>t_2>\cdots\). Stop immediately before the first partial sum that reaches \(kd\). Call the sum so far \(S\) and its last term \(t\). The deficit \(R=kd-S\) satisfies \(1\le R\le t_{\rm next}3\). A Hanoi tiling of the top \(w\)-by-\(H\) rectangle exists by the lemma below. Each cap tile resting on the last complete row has side at most \(H