502

Part of 1989 All Soviet Union Mathematical Olympiad

Problems(1)

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

Source:

Show that for each integer

n > 0

, there is a polygon with vertices at lattice points and all sides parallel to the axes, which can be dissected into

1 \times 2

2 \times 1

) rectangles in exactly

n

lattice pointspolygonrectangleTiling