Problems

Age
Difficulty
Found: 18

A \((2n - 1) \times (2n - 1)\) board is tiled with pieces of the following possible types:

image

Prove that at least \(4n-1\) of the first type have been used.

In an \(n \times n\) board the squares are painted black or white in some way. Three of the squares in the corners are white and one is black. Show that there is a \(2\times 2\) square with an odd number of white unit squares.

On an \(8\times 8\) board there is a lamp in every square. Initially every lamp is turned off. In a move we choose a lamp and a direction (it can be the vertical direction or the horizontal one) and change the state of that lamp and all its neighbours in that direction. After a certain number of moves, there is exactly one lamp turned on. Find all the possible positions of that lamp.

In an \(5\times 5\) board one corner was removed. Is it possible to cover the remaining board with linear trominos (\(1\times 3\) blocks)?

Is it possible to cover a \(6 \times 6\) board with the \(L\)-tetraminos without overlapping? The pieces can be flipped and turned.

image

Is it possible to cover a \((4n+2) \times (4n+2)\) board with the \(L\)-tetraminos without overlapping for any \(n\)? The pieces can be flipped and turned.

image

Is it possible to cover a \(4n \times 4n\) board with the \(L\)-tetraminos without overlapping for any \(n\)? The pieces can be flipped and turned.

image

In an \(n\times n\) table, two opposite corner squares are black and the rest are white. We wish to turn the whole \(n\times n\) table black in two stages. In the first stage, we paint black some of the squares that are white at the moment. In the second stage, we can perform the following two operations as much as we like. The row operation is to swap the colours of all the squares in a particular row. The column operation is to swap the colours of all the squares in a particular column. What is the fewest number of white squares that we can paint in the first stage?

An example of the row operation: let W stand for white and B stand for black and suppose that \(n=5\). Also suppose that a particular row has the colours WWBWB. Then performing the row operation would change this row to BBWBW.