olymmath

USAMO 2009 Problem 3

We define a chessboard polygon to be a polygon whose sides are situated along lines of the form x=ax = a or y=by = b , where aa and bb are integers. These lines divide the interior into unit squares, which are shaded alternately grey and white so that adjacent squares have different colors. To tile a chessboard polygon by dominoes is to exactly cover the polygon by non-overlapping 1×21 \times 2 rectangles. Finally, a tasteful tiling is one which avoids the two configurations of dominoes shown on the left below. Two tilings of a 3×43 \times 4 rectangle are shown; the first one is tasteful, while the second is not, due to the vertical dominoes in the upper right corner.

Distasteful tilings\mathrm{Distasteful\ tilings}

a) Prove that if a chessboard polygon can be tiled by dominoes, then it can be done so tastefully.

b) Prove that such a tasteful tiling is unique.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator usamo/2009/p3 · Tag 5GDTYS6NB5 · Edit this page on GitHub · Keys: j next, k previous