MathDB
min no of rectangular tiles needed to cover the remaining surface in square

Source: 2012 Romania JBMO TST 2.2

June 2, 2020
combinatoricsSquares

Problem Statement

From an n×nn \times n square, n≥2,n \ge 2, the unit squares situated on both odd numbered rows and odd numbers columns are removed. Determine the minimum number of rectangular tiles needed to cover the remaining surface.
Back to ProblemsView on AoPS