MathDB
JBMO 2010. Problem 4.

Source:

June 20, 2010
geometryrectanglerotationinequalitiescombinatorics proposedcombinatorics

Problem Statement

A 9×79\times 7 rectangle is tiled with tiles of the two types: L-shaped tiles composed by three unit squares (can be rotated repeatedly with 9090^\circ) and square tiles composed by four unit squares. Let n0n\ge 0 be the number of the 2×22 \times 2 tiles which can be used in such a tiling. Find all the values of nn.