Problems

Prove that there exist numbers, that can be presented in no fewer than 100 ways in the form of a summation of 20001 terms, each of which is the 2000th power of a whole number.

Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.

2001 vertices of a regular 5000-gon are painted. Prove that there are three coloured vertices lying on the vertices of an isosceles triangle.

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}\).

Prove that a convex quadrilateral \(ICEF\) can have a circle inscribed into it if and only if \(IC+EH = CE+IF\).

Daniel has drawn on a sheet of paper a circle and a dot inside it. Show that he can cut a circle into two parts which can be used to make a circle in which the marked point would be the center.

Elon is studying the Twitter server. Inside the software he found two integer variables \(a\) and \(b\) which change their values when special search queries “RED”, “GREEN”, and “BLUE” are processed. More precisely the pair \((a, b)\) changes into \((a + 18b, 18a - b)\) when processing the query “RED”, to \((17a + 6b, -6a + 17b)\) when processing “GREEN”, and to \((-10a - 15b, 15a - 10b)\) when processing “BLUE”. When any of \(a\) or \(b\) reaches a multiple of \(324\), it resets to \(0\). If \((a, b) = (0, 0)\) the server crashes. On the server startup, the variables \((a, b)\) are set to \((20, 20)\). Prove that the server will never crash with these initial values, regardless of the search queries processed.

Is it possible to cut an equilateral triangle into three equal hexagons?

A labyrinth was drawn on a \(5\times 5\) grid square with an outer wall and an exit one cell wide, as well as with inner walls running along the grid lines. In the picture, we have hidden all the inner walls from you (We give you several copies to facilitate drawing) 
Please draw how the walls were arranged. Keep in mind that the numbers in the cells represent the smallest number of steps needed to exit the maze, starting from that cell. A step can be taken to any adjacent cell vertically or horizontally, but not diagonally (and only if there is no wall between them, of course).

Is it possible to cut this figure, called "camel"

• a) along the grid lines;

• b) not necessarily along the grid lines;

into \(3\) parts, which you can use to build a square?
(We give you several copies to facilitate drawing)