Problem

Source: Belarus 2010 TST 6.3

Tags: Tiling, combinatorial geometry, combinatorics, tiles



A $50 \times 50$ square board is tiled by the tetrominoes of the following three types: Find the greatest and the smallest possible number of $L$ -shaped tetrominoes In the tiling. (Folklore)