olymmath

OMM 2011 Problem 5

    A (2n−1)×(2n+1)(2^n - 1) \times (2^n +1) board is to be divided into rectangles with sides parallel to the sides of the board and integer side lengths such that the area of each rectangle is a power of 2. Find the minimum number of rectangles that the board may be divided into.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

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

    Locator mx-omm/2011/p5 · Tag M6DG0Z4NAQ · Edit this page on GitHub · Keys: j next, k previous