Two players in turn put coins on a round table, in such a way that they do not overlap. The player who can not make a move loses.
Arrange in a row the numbers from 1 to 100 so that any two neighbouring ones differ by at least 50.
An \(8 \times 8\) square is painted in two colours. You can repaint any \(1 \times 3\) rectangle in its predominant colour. Prove that such operations can make the whole square monochrome.
Some person \(A\) thought of a number from 1 to 15. Some person \(B\) asks some questions to which you can answer ‘yes’ or ‘no’. Can \(B\) guess the number by asking a) 4 questions; b) 3 questions.
The numbers from 1 to 9999 are written out in a row. How can I remove 100 digits from this row so that the remaining number is a) maximal b) minimal?
Two grandmasters in turn put rooks on a chessboard (one turn – one rook) so that they cannot capture each other. The person who cannot put a rook on the chessboard loses. Who will win with the game – the first or second grandmaster?
Four aliens – Dopey, Sleepy, Happy, Moody from the planet of liars and truth tellers had a conversation: Dopey to Sleepy: “you are a liar”; Happy to Sleepy: “you are a liar”; Moody to Happy: “Yes, they are both liars,” (after a moment’s thought), “however, so are you.” Which of them is telling the truth?
One of five brothers baked a cake for their Mum. Alex said: “This was Vernon or Tom.” Vernon said: “It was not I and not Will who did it.” Tom said: “You’re both lying.” David said: “No, one of them told the truth, and the other was lying.” Will said: “No David, you’re wrong.” Mum knows that three of her sons always tell the truth. Who made the cake?
It is known that among the members of the government of the Planet of Liars and truth tellers, consisting of 20 members, there is at least one honest one, and also that from any two at least one is a bribe taker. How many bribe takers are there in the government?
100 fare evaders want to take a train, consisting of 12 coaches, from the first to the 76th station. They know that at the first station two ticket inspectors will board two coaches. After the 4th station, in the time between each station, one of the ticket inspectors will cross to a neighbouring coach. The ticket inspectors take turns to do this. A fare evader can see a ticket inspector only if the ticket inspector is in the next coach or the next but one coach. At each station each fare evader has time to run along the platform the length of no more than three coaches – for example at a station a fare evader in the 7th coach can run to any coach between the 4th and 10th inclusive and board it. What is the largest number of fare evaders that can travel their entire journey without ever ending up in the same coach as one of the ticket inspectors, no matter how the ticket inspectors choose to move? The fare evaders have no information about the ticket inspectors beyond that which is given here, and they agree their strategy before boarding.