MathDB
L- trominos in a nxn square

Source: 1998 Estonia National Olympiad Final Round grade 12 p5

March 11, 2020
combinatoricscombinatorial geometrysquare

Problem Statement

From an n×nn\times n square divided into n2n^2 unit squares, one corner unit square is cut off. Find all positive integers nn for which it is possible to tile the remaining part of the square with LL-trominos. https://cdn.artofproblemsolving.com/attachments/0/4/d13e6e7016d943b867f44375a2205b10ccf552.png