Tetromino
Source: Round 1: BMO 2001/3
March 17, 2019
combinatoricsnumber theoryalgebra
Problem Statement
A is a figure made up of four unit squares connected by common edges.
[List=i]
[*] If we do not distinguish between the possible rotations of a tetromino within its plane, prove that there are seven distinct tetrominos.
[*]Prove or disprove the statement: It is possible to pack all seven distinct tetrominos into rectangle without overlapping.