Tiling a Rectangle with the Fewest Squares

We show that a square-tiling of ap×qrectangle, wherepandqare relatively prime integers, has at least log2 psquares. Ifq>pwe construct a square-tiling with less thanq/p+C log psquares of integer size, for some universal constantC.