MathDB
Minimum number of fields with figures

Source: Serbian JBTST 3, Day 1

May 30, 2009
combinatorics proposedcombinatorics

Problem Statement

On each field of the board n×n n\times n there is one figure, where n≥2n\ge 2. In one move we move every figure on one of its diagonally adjacent fields. After one move on one field there can be more than one figure. Find the least number of fields on which there can be all figures after some number of moves.
Back to ProblemsView on AoPS