Tiling a rectangle with the fewest squares

Abstract

We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least ${\log }_{2}p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some universal constant $C$.