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}\).
Let the number \(\alpha\) be given by the decimal:
a) \(0.101001000100001000001 \dots\);
b) \(0.123456789101112131415 \dots\).
Will this number be rational?
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?
A function \(f\) is given, defined on the set of real numbers and taking real values. It is known that for any \(x\) and \(y\) such that \(x > y\), the inequality \((f (x)) ^2 \leq f (y)\) is true. Prove that the set of values generated by the function is contained in the interval \([0,1]\).
a) There are three identical large vessels. In one there are 3 litres of syrup, in the other – 20 litres of water, and the third is empty. You can pour all the liquid from one vessel into another or into a sink. You can choose two vessels and pour into one of them liquid from the third, until the liquid levels in the selected vessels are equal. How can you get 10 litres of diluted 30% syrup?
b) The same, but there is \(N\) l of water. At what integer values of \(N\) can you get 10 liters of diluted 30% syrup?
Monica is in a broken space buggy at a distance of 18 km from the Lunar base, in which Rachel sits. There is a stable radio communication system between them. The air reserve in the space buggy is enough for 3 hours, in addition, Monica has an air cylinder for the spacesuit, with an air reserve of 1 hour. Rachel has a lot of cylinders with an air supply of 2 hours each. Rachel can not carry more than two cylinders at the same time (one of them she uses herself). The speed of movement on the Moon in the suit is 6 km/h. Could Rachel save Monica and not die herself?
301 schoolchildren came to the school’s New Year’s party in the city of Moscow. Some of them always tell the truth, and the rest always lie. Each of some 200 students said: “If I leave the hall, then among the remaining students, the majority will be liars.” Each of the other schoolchildren said: “If I leave the room, then among the remaining students, there will be twice as many liars as those who speak the truth.” How many liars were at the party?
Two play the following game. There is a pile of stones. The first takes either 1 stone or 10 stones with each turn. The second takes either m or n stones with every turn. They take turns, beginning with the first player. He who can not make a move, loses. It is known that for any initial quantity of stones, the first one can always play in such a way as to win (for any strategy of the second player). What values can m and n take?
A robot came up with a cipher for writing words: he replaced some letters of the alphabet with single-digit or two-digit numbers, using only the digits 1, 2 and 3 (different letters it replaces with different numbers). First, he wrote down, using the cipher: \(ROBOT = 3112131233\). Having encrypted the words \(CROCODIL\) and \(BEGEMOT\), he was surprised to note that the numbers were completely identical! Then the Robot ciphered the word \(MATHEMATICS\). Write down the number that he got.
Does there exist a function \(f (x)\) defined for all real numbers such that \(f(\sin x) + f (\cos x) = \sin x\)?