# When Can You Tile an Integer Rectangle with Integer Squares?

• Published in 2023
In the collections
This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible when both $m$ and $n$ are sufficiently large (at least 10). When one dimension $m$ is small, the behavior is eventually periodic in $n$ with period 1, 2, or 3. When both dimensions $m,n$ are small, the behavior is determined computationally by an exhaustive search.

## Other information

key
WhenCanYouTileanIntegerRectanglewithIntegerSquares
type
article
2023-10-09
date_published
2023-11-28

### BibTeX entry

@article{WhenCanYouTileanIntegerRectanglewithIntegerSquares,
key = {WhenCanYouTileanIntegerRectanglewithIntegerSquares},
type = {article},
title = {When Can You Tile an Integer Rectangle with Integer Squares?},
author = {MIT CompGeom Group and Zachary Abel and Hugo A. Akitaya and Erik D. Demaine and Adam C. Hesterberg and Jayson Lynch},
abstract = {This paper characterizes when an {\$}m \times n{\$} rectangle, where {\$}m{\$} and {\$}n{\$}
are integers, can be tiled (exactly packed) by squares where each has an
integer side length of at least 2. In particular, we prove that tiling is
always possible when both {\$}m{\$} and {\$}n{\$} are sufficiently large (at least 10).
When one dimension {\$}m{\$} is small, the behavior is eventually periodic in {\$}n{\$}
with period 1, 2, or 3. When both dimensions {\$}m,n{\$} are small, the behavior is
determined computationally by an exhaustive search.},
comment = {},
}