For an integer
, we consider partitions of a
chessboard into rectangles consisting of cells of chessboard, in which each of the
cells along one diagonal forms a separate rectangle of side length
. Determine the smallest possible sum of rectangle perimeters in such a partition.
Proposed by Gerhard Woeginger, Netherlands




Proposed by Gerhard Woeginger, Netherlands