Problem

Source: Argentina IMO 2005 TST, problem 1

Tags: combinatorics proposed, combinatorics



Find all pairs of integers (m,n) such that an m×n board can be totally covered with 1×3 and 2×5 pieces.