olymmath

KöMaL 2012 K359

    Let the natural number nn be at least 5. Prove that it is possible to divide a rectangle into nn smaller rectangles, such that no two adjacent small rectangles form a larger rectangle together.

    Official text KöMaL. 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 hu-komal/2012/k359 · Tag W5K1HFPDWN · Edit this page on GitHub · Keys: j next, k previous