MathDB
Board

Source: JBMO 2006

June 29, 2006
geometryrectanglesymmetryfloor functioncombinatorics unsolvedcombinatorics

Problem Statement

Consider a 2n×2n2n \times 2n board. From the iith line we remove the central 2(i1)2(i-1) unit squares. What is the maximal number of rectangles 2×12 \times 1 and 1×21 \times 2 that can be placed on the obtained figure without overlapping or getting outside the board?