Upon the installation of a keypad lock, each of the 26 letters located on the lock’s keypad is assigned an arbitrary natural number known only to the owner of the lock. Different letters do not necessarily have different numbers assigned to them. After a combination of different letters, where each letter is typed once at most, is entered into the lock a summation is carried out of the corresponding numbers to the letters typed in. The lock opens only if the result of the summation is divisible by 26. Prove that for any set of numbers assigned to the 26 letters, there exists a combination that will open the lock.
In an \(n\) by \(n\) grid, \(2n\) of the squares are marked. Prove that there will always be a parallelogram whose vertices are the centres of four of the squares somewhere in the grid.
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.
A hostess bakes a cake for some guests. Either 10 or 11 people can come to her house. What is the smallest number of pieces she needs to cut the cake into (in advance) so that it can be divided equally between 10 and 11 guests?
Two players play the following game. They take turns. One names two numbers that are at the ends of a line segment. The next then names two other numbers, which are at the ends of a segment nested in the previous one. The game goes on indefinitely. The first aims to have at least one rational number within the intersection of all of these segments, and the second aims to prevent such occurring. Who wins in this game?
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}\).
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.
The positive irrational numbers \(a\) and \(b\) are such that \(1/a + 1/b = 1\). Prove that among the numbers \(\lfloor ma\rfloor , \lfloor nb\rfloor\) each natural number occurs exactly once.
26 numbers are chosen from the numbers 1, 2, 3, ..., 49, 50. Will there always be two numbers chosen whose difference is 1?