Problems

There are three piles of rocks: in the first pile there are 10 rocks, 15 in the second pile and 20 in the third pile. In this game (with two players), in one turn a player is allowed to divide one of the piles into two smaller piles. The loser is the one who cannot make a move. Which player would be the winner?

Anna has $20$ novels and $25$ comic books on her shelf. She doesn’t really keep her room very tidy and so she also has a lot of novels and comic books in various places around her room. Each time she reaches for the shelf, she takes two books and puts one back. If she takes two novels or two comic books, she puts a novel back on the shelf. If she takes a novel and a comic book, she places another comic book on the shelf. That way, her shelf sistematically empties. Show that eventually there will be a lone comic book standing on her shelf and all her other books scattered across her room.

A knight in chess moves in an “L” pattern – two squares in one direction and one square in a perpendicular direction. Starting with a knight in the bottom right corner of a regular $8\times 8$ chessboard, can you move it some number of times according to the rules in such a way that it visits every square on the chessboard exactly once and ends up in the top left corner?

Nine lightbulbs are arranged in a $3\times 3$ square. Some are on, some are off. You are allowed to change the state of all the bulbs in a column or in a row. That means all the bulbs in that row or column that were off light up and the ones that were on go dark. Is it possible to go from the arrangement in the left to the one on the right by repeating this operation?

Anna’s sister, Claire, has $10$ novels, $11$ textbooks and $12$ comic books on her shelf. She also doesn’t like to keep all her books there. Each time she takes two books of different type from the shelf and puts a book of the third type back on. So for example, she might take a novel and a comic book and put a textbook back. Show that eventually there is only a single textbook, and exactly a textbook, left on her shelf.

All the squares of a $9\times 9$ chessboard were coloured black and white in a traditional way, such that the corner squares are all white. In each move, you can choose two neighbouring squares and change both of their colours – black to white and white to black. Can you reach a chessboard that is all black in this way?

a) 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 a “little rook” in the bottom right corner of an $8\times 8$ chessboard, can we make it to the opposite corner while visiting each square exactly once?

b) A king in chess moves like the “little rook”, but he can also move one square along a diagonal. Can we do the same task with a king?

There are $15$ lightbulbs in a row, they are 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?

Are there such integer numbers $a,b,c,d,e,f$ that the numbers $$a-b,b-c,c-d,d-e,e-f,f-a$$ are consecutive integers? (Note: they obviously can be negative.)

There are numbers $1,2,3,4,5,6,7,8,9$ and $10$ written on a board. Each time you make a “move” you can erase three of the remaining numbers, $a,b$ and $c$, and replace them with the numbers $2a+b$, $2b+c$ and $2c+b$. The goal is to make all the $10$ numbers left on the board equal. Is it possible?