MathDB
Divide rectangle into squares

Source: 2001 China Second Round Olympiad P3

August 11, 2019
combinatorial geometrycombinatorics

Problem Statement

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.
Back to ProblemsView on AoPS