MathDB
Cono Sur Olympiad 2011, Problem 6

Source:

August 23, 2014
combinatorics proposedcombinatoricsHi

Problem Statement

Let QQ be a (2n+1)×(2n+1)(2n+1) \times (2n+1) board. Some of its cells are colored black in such a way that every 2×22 \times 2 board of QQ has at most 22 black cells. Find the maximum amount of black cells that the board may have.
Back to ProblemsView on AoPS