benchmarks.wiki

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 … · Discussion

Discussing 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 … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.