MathDB
ASU 502 All Soviet Union MO 1989 lattice polygon, disected in 1x2 in n ways

Source:

August 13, 2019
lattice pointspolygonrectangleTiling

Problem Statement

Show that for each integer n>0n > 0, there is a polygon with vertices at lattice points and all sides parallel to the axes, which can be dissected into 1×21 \times 2 (and / or 2×12 \times 1) rectangles in exactly nn ways.
Back to ProblemsView on AoPS