benchmarks.wiki / Public workspace

Omni-MATH / For an integer m≥1, we consider partitions of a 2^(m)×2^(m) chessboard into rectangles consisting of cells of chessboard, in which each of the 2^(m) cells along one diagonal forms …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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 chessboard, in which each of the 2m2^m cells along one diagonal forms a separate rectangle of side length 11. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]
Plain-text mathematical notation (without MathML)
For an integer m≥1, we consider partitions of a 2^(m)×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.

[i]
Original LaTeX notation
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.

[i]

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import