Problems

A rook in chess can move any number of squares in the same row or column. Let’s invent a new figure, a "little rook" that can only move one square in each of these directions. If we start with the "little rook" in the bottom right corner of an $8\times 8$ chessboard, can we make it to the top left corner while visiting each square exactly once?

There are $15$ lightbulbs in a row, all switched off. We can pick any three of them and change their state. Can we repeat this operation an even number of times such that at the end all the lightbulbs are on?

In the triangle $ABC$ the segment $AB=5$ and the segment $BD$ is the median. The segment $AE$ is perpendicular to $BD$ and divides $BD$ in half. Find the length of $AC$.

Can you cover a $10\times 10$ board using only $T$-shaped tetrominos?

Can you cover a $10\times 10$ square with $1\times 4$ rectangles?

Two opposite corners were removed from an $8\times 8$ chessboard. Is it possible to cover this chessboard with $1\times 2$ rectangular blocks?

One unit square of a $10\times 10$ square board was removed. Is it possible to cover the rest of it with $3$-square $L$-shaped blocks?

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

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)?

Convert the binary number $10011$ into decimal, and convert the decimal number $28$ into binary. Multiply by $2$ as binary numbers both $10011$ and the result of conversion of $28$ into binary numbers.