MathDB
tiling a nxn board with 6-tiles May Olympiad (Olimpiada de Mayo) 2011 L1 P5

Source:

September 28, 2021
combinatoricsTilingtiles

Problem Statement

Determine for which natural numbers nn it is possible to completely cover a board of n×n n \times n, divided into 1×11 \times 1 squares, with pieces like the one in the figure, without gaps or overlays and without leaving the board. Each of the pieces covers exactly six boxes.
Note: Parts can be rotated. https://cdn.artofproblemsolving.com/attachments/c/2/d87d234b7f9799da873bebec845c721e4567f9.png