olymmath

KöMaL 2021 K692

    A 6×66\times6 square is dissected into lattice rectangles. What is the largest possible number of noncongruent rectangles obtained? Give an example.

    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/2021/k692 · Tag SS8QY69VNJ · Edit this page on GitHub · Keys: j next, k previous