On the board the number 1 is written. Two players in turn add any number from 1 to 5 to the number on the board and write down the total instead. The player who first makes the number thirty on the board wins. Specify a winning strategy for the second player.
There are two stacks of coins on a table: in one of them there are 30 coins, and in the other – 20. You can take any number of coins from one stack per move. The player who cannot make a move is the one that loses. Which player wins with the correct strategy?
A journalist came to a company which had \(N\) people. He knows that this company has a person \(Z\), who knows all the other members of the company, but nobody knows him. A journalist can address each member of the company with the question: “Do you know such and such?” Find the smallest number of questions sufficient to surely find \(Z\). (Everyone answers the questions truthfully. One person can be asked more than one question.)
Each of the three cutlets should be fried in a pan on both sides for five minutes each side. Only two cutlets can fit onto the frying pan. Is it possible to fry all three cutlets more quickly than in 20 minutes (if the time to turn over and transfer the cutlets is neglected)?
Your task is to find out a five-digit phone number, asking questions that can be answered with either “yes” or “no.” What is the smallest number of questions for which this can be guaranteed (provided that the questions are answered correctly)?
What weights can three weights have so that they can weigh any integer number of kilograms from 1 to 10 on weighing scales (weights can be put on both cups)? Give an example.
The rook stands on the square a1 of a chessboard. For a move, you can move it by any number of cells to the right or up. The one who puts the rook on the h8 square will win. Who wins with the right strategy?
Hannah has 10 employees. Each month, Hannah raises the salary by 1 pound of exactly nine of her employees (of her choice). How can Hannah raise the salaries to make them equal? (Salaries are an integer number of pounds.)
Three friends decide, by a coin toss, who goes to get the juice. They have one coin. How do they arrange coin tosses so that all of them have equal chances to not have to go and get the juice?
To transmit messages by telegraph, each letter of the Russian alphabet () ( and are counted as identical) is represented as a five-digit combination of zeros and ones corresponding to the binary number of the given letter in the alphabet (letter numbering starts from zero). For example, the letter is represented in the form 00000, letter -00001, letter -10111, letter -11111. Transmission of the five-digit combination is made via a cable containing five wires. Each bit is transmitted on a separate wire. When you receive a message, Cryptos has confused the wires, so instead of the transmitted word, a set of letters is received. Find the word you sent.