olymmath

ISL 2009 C4

For an integer m≥1m \geq 1, we consider partitions of a 2m×2m2^{m} \times 2^{m} chessboard into rectangles consisting of cells of the chessboard, in which each of the 2m2^{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.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2009 Shortlist booklet, page 8.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2009/c4 · Tag 5HKX2R90S0 · Edit this page on GitHub · Keys: j next, k previous