Show that any n x n deficient board can be tiled with trominoes if n is odd, n >5, and 3 divides n2 − 1.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.