MathDB
Problem with dominoes

Source: Baltic Way 2008, Problem 15

November 23, 2008
geometrycombinatorics unsolvedcombinatorics

Problem Statement

Some 1×21\times 2 dominoes, each covering two adjacent unit squares, are placed on a board of size n×nn\times n such that no two of them touch (not even at a corner). Given that the total area covered by the dominoes is 20082008, find the least possible value of nn.
Back to ProblemsView on AoPS