Problem

Source:

Tags: geometry, rectangle, combinatorics proposed, combinatorics



Determine all pairs $(m,n)$ of positive integers such that a $m\times n$ rectangle can be tiled with L-trominoes.