At all rational points of the real line, integers are arranged. Prove that there is a segment such that the sum of the numbers at its ends does not exceed twice the number on its middle.
Does there exist a natural number which, when divided by the sum of its digits, gives a quotient and remainder both equal to the number 2011?
a) A square of area 6 contains three polygons, each of area 3. Prove that among them there are two polygons that have an overlap of area no less than 1.
b) A square of area 5 contains nine polygons of area 1. Prove that among them there are two polygons that have an overlap of area no less than \(\frac{1}{9}\).
We are given 111 different natural numbers that do not exceed 500. Could it be that for each of these numbers, its last digit coincides with the last digit of the sum of all of the remaining numbers?
All integers from 1 to \(2n\) are written in a row. Then, to each number, the number of its place in the row is added, that is, to the first number 1 is added, to the second – 2, and so on.
Prove that among the sums obtained there are at least two that give the same remainder when divided by \(2n\).
On a chessboard, \(n\) white and \(n\) black rooks are arranged so that the rooks of different colours cannot capture one another. Find the greatest possible value of \(n\).
Each of the 102 pupils of one school is friends with at least 68 others. Prove that among them there are four who have the same number of friends.
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.