MathDB

covering a board...

Source: Argentina IMO 2005 TST, problem 1

April 28, 2005

combinatorics proposedcombinatorics

Problem Statement

Find all pairs of integers

(m,n)

such that an

m\times n

board can be totally covered with

1\times 3

and

2 \times 5

pieces.

Back to Problems View on AoPS