Problem:
A square is divided into smaller squares of dimensions , , and . What is the minimum possible number of squares?
Problem:
A square is divided into smaller squares of dimensions , , and . What is the minimum possible number of squares?
Solution:
Color the rows of the square black and white alternately, so the top and bottom rows are black. Then each tile covers two cells of each color, and each tile covers six of one color and three of the other. In particular, if only and tiles are used, the difference between the number of black and white cells covered is divisible by . But the entire board has more black than white cells (if the bottom row were removed, the colors would be equally represented). So there must
be at least one tile.
To construct the required tiling with only one tile, first use tiles to build a rectangle and tiles to build a rectangle. Join these two rectangles to form an rectangle. Then use four copies of this rectangle, together with the square, to build a square as shown in the diagram.