Varoon and Mahmoud are given two plates of fruit. On one plate, there are \(13\) apples, on the other, there are \(16\) pears. Each of the boys can take any number of fruit from one plate when he moves. The person who takes the last fruit wins. If Mahmoud starts, who will win?
This time, Sally and Fatima have some number of books on a shelf. Every turn, each of them is allowed to take 1, 3 or 4 books from the shelf. The girl that takes the last book wins, Sally goes first. Who will win if there are: a) 14, b) 16, c) 19 books on the shelf?
Danny and Robbie draw diagonals of a regular \(2018\)-gon. They can only draw a diagonal that does not cross any other diagonal that has been already drawn, neither it begins nor ends at a same point as any other drawn diagonal. Robbie starts – can he always win?
Adam and Anthony are playing with a chessboard and a rook. The rook can only be moved either to the bottom or to the left. Each of the boys can move it as far as he wants, but only in a straight line either to the bottom or to the left. The boy who places the rook in the bottom left corner wins. Adam starts, show that he can lose to Anthony only if the rook starts somewhere on the main diagonal.
Nathan and Liam have numbers from \(1\) to \(2018\) written on a board. In each move, one of the players removes a number of their choosing, which is still on the board, together with all its remaining divisors. Liam goes first. The last person to remove a number wins. Who has the winning strategy?
Alex and Priyanka have a chessboard and a queen on it. Each of the players can only move the queen to the top, to the right, or along a diagonal – to the top and right (like the queen moves, but only in three directions out of all eight). The person who places the queen in the top right corner wins. The chessboard is a normal \(8 \times 8\) board. The queen starts four squares to the right from the bottom left corner. If Priyanka starts, who will win the game?
A two-player game with matches. There are 37 matches on the table. In each turn, a player is allowed to take no more than 5 matches. The winner of the game is the player who takes the final match. Which player wins, if the right strategy is used?
The seller with weights. With four weights the seller can weigh any integer number of kilograms, from 1 to 40 inclusive. The total mass of the weights is 40 kg. What are the weights available to the seller?
Two weighings. There are 7 coins which are identical on the surface, including 5 real ones (all of the same weight) and 2 counterfeit coins (both of the same weight, but lighter than the real ones). How can you find the 3 real coins with the help of two weighings on scales without weights?
We are looking for the correct statement. In a notebook one hundred statements are written:
1) There is exactly one false statement in this notebook.
2) There are exactly two false statements in this notebook.
...
100) There are exactly one hundred false statements in this notebook.
Which of these statements is true, if it is known that only one is true?