MathDB
Minimal Numbers of Sticks

Source: Romanian Masters 2017 D2 P2

February 25, 2017
combinatoricsRMMRMM 2017Tiling

Problem Statement

Fix an integer n≥2n \geq 2. An n×nn\times n sieve is an n×nn\times n array with nn cells removed so that exactly one cell is removed from every row and every column. A stick is a 1×k1\times k or k×1k\times 1 array for any positive integer kk. For any sieve AA, let m(A)m(A) be the minimal number of sticks required to partition AA. Find all possible values of m(A)m(A), as AA varies over all possible n×nn\times n sieves.
Palmer Mebane
Back to ProblemsView on AoPS