olymmath

CN-LEAGUE 2001 Problem 3

    An m×n(m,n∈N∗)m\times n(m,n\in \mathbb{N}^*) rectangle is divided into some smaller squares. The sides of each square are all parallel to the corresponding sides of the rectangle, and the length of each side is integer. Determine the minimum of the sum of the sides of these squares.

    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 cn-league/2001/p3 · Tag YKPXG23F38 · Edit this page on GitHub · Keys: j next, k previous