Let be given an $n \times n$ chessboard, $n \in N$. We wish to tile it using particular tetraminos which can be rotated. For which $n$ is this possible if we use (a) $T$-tetraminos (b) both kinds of $L$-tetraminos?
Problem
Source: Norwegian Mathematical Olympiad 1998 - Abel Competition p2
Tags: combinatorics, Chessboard, tetraminos