« Vrati se
For an integer m\geq 1, we consider partitions of a 2^m\times 2^m chessboard into rectangles consisting of cells of chessboard, in which each of the 2^m cells along one diagonal forms a separate rectangle of side length 1. Determine the smallest possible sum of rectangle perimeters in such a partition.

Proposed by Gerhard Woeginger, Netherlands

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2302IMO Shortlist 2009 problem C60
2271IMO Shortlist 2008 problem C14
2245IMO Shortlist 2007 problem C52
2242IMO Shortlist 2007 problem C26
2213IMO Shortlist 2006 problem C42
2049IMO Shortlist 2000 problem C50