2001 vertices of a regular 5000-gon are painted. Prove that there are three coloured vertices lying on the vertices of an isosceles triangle.
Prove that rational numbers from \([0; 1]\) can be covered by a system of intervals of total length no greater than \(1/1000\).
Father Christmas has an infinite number of sweets. A minute before the New Year, Father Christmas gives some children 100 sweets, while the Snow Maiden takes one sweet from them. Within half a minute before the New Year, Father Christmas gives the children 100 more sweets, and the Snow Maiden again takes one sweet. The same is repeated for 15 seconds, for 7.5 seconds, etc. until the new Year. Prove that the Snow Maiden will be able to take away all the sweets from the children by the New Year.
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 key of the cipher, called the “swivelling grid”, is a stencil made from a square sheet of chequered paper of size \(n \times n\) (where \(n\) is even). Some of the cells are cut out. One side of the stencil is marked. When this stencil is placed onto a blank sheet of paper in four possible ways (marked side up, right, down or left), its cut-outs completely cover the entire area of the square, where each cell is found under the cut-out exactly once. The letters of the message, that have length \(n^2\), are successively written into the cut-outs of the stencil, where the sheet of paper is placed on a blank sheet of paper with the marked side up. After filling in all of the cut-outs of the stencil with the letters of the message, the stencil is placed in the next position, etc. After removing the stencil from the sheet of paper, there is an encrypted message.
Find the number of different keys for an arbitrary even number \(n\).
A cryptogram is given:
Restore the numerical values of the letters under which all of the equalities are valid, if different letters correspond to different digits. Arrange the letters in order of increasing numerical value and to find the required string of letters.
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?
Let \(x\) be a natural number. Among the statements:
\(2x\) is more than 70;
\(x\) is less than 100;
\(3x\) is greater than 25;
\(x\) is not less than 10;
\(x\) is greater than 5;
three are true and two are false. What is \(x\)?
A city in the shape of a triangle is divided into 16 triangular blocks, at the intersection of any two streets is a square (there are 15 squares in the city). A tourist began to walk around the city from a certain square and travelled along some route to some other square, whilst visiting every square exactly once. Prove that in the process of travelling the tourist at least 4 times turned by \(120^{\circ}\).
It is known that any person has at most 400,000 hairs on their head. Given that the population of London is not less than 8 million, prove that there are 20 Londoners with the same number of hairs on their heads.