A raisin bag contains 2001 raisins with a total weight of 1001 g, and no raisin weighs more than 1.002 g.
Prove that all the raisins can be divided onto two scales so that they show a difference in weight not exceeding 1 g.
We are given 101 natural numbers whose sum is equal to 200. Prove that we can always pick some of these numbers so that the sum of the picked numbers is 100.
10 numbers are written around the circle, the sum of which is equal to 100. It is known that the sum of every three numbers standing side by side is not less than 29.
Specify the smallest number \(A\) such that in any such set of numbers each of the numbers does not exceed \(A\).
10 natural numbers are written on a blackboard. Prove that it is always possible to choose some of these numbers and write “\(+\)” or “\(-\)” between them so that the resulting algebraic sum is divisible by 1001.
A daisy has a) 12 petals; b) 11 petals. Consider the game with two players where: in one turn a player is allowed to remove either exactly one petal or two petals which are next to each other. The loser is the one who cannot make a turn. How should the second player act, in cases a) and b), in order to win the game regardless of the moves of the first player?
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?
Given a board (divided into squares) of the size: a) \(10\times 12\), b) \(9\times 10\), c) \(9\times 11\), consider the game with two players where: in one turn a player is allowed to cross out any row or any column if there is at least one square not crossed out. The loser is the one who cannot make a move. Is there a winning strategy for one of the players?
Three people are talking at dinner: Greyson, Blackburne and Reddick. The black-haired person told Greyson: “It is curious that one of us is grey-haired, the other is black-haired, and the third is red-haired, but no one has hair colour that matches their surname.” What colour hair does each of the men chatting have?
In a group of friends, each two people have exactly five common acquaintances. Prove that the number of pairs of friends is divisible by 3.