Question 50
Abel has an infinite amount of type-A and -B pieces. Type-A pieces are composed of five unit squares and type-B pieces are composed of six unit squares, as shown below:
Abel wants to cover a $n \times n$ checkerboard, divided into $n^2$ unit squares, using these pieces without overlapping them or leaving part of them out of the board.
Determine the smallest $n$ for which Abel can achieve this.
Abel wants to cover a $n \times n$ checkerboard, divided into $n^2$ unit squares, using these pieces without overlapping them or leaving part of them out of the board.
Determine the smallest $n$ for which Abel can achieve this.