Let \(f\) be a continuous function defined on the interval \([0; 1]\) such that \(f (0) = f (1) = 0\). Prove that on the segment \([0; 1]\) there are 2 points at a distance of 0.1 at which the function \(f 4(x)\) takes equal values.
A convex figure and point \(A\) inside it are given. Prove that there is a chord (that is, a segment joining two boundary points of a convex figure) passing through point \(A\) and dividing it in half at point \(A\).
In how many ways can you rearrange the numbers from 1 to 100 so that the neighbouring numbers differ by no more than 1?
There are 18 sweets in one piles, and 23 in another. Two play a game: in one go one can eat one pile of sweets, and the other can be divided into two piles. The loser is one who cannot make a move, i.e. before this player’s turn there are two piles of sweets with one sweet in each. Who wins with a regular game?
Your task is to find out a five-digit phone number, asking questions that can be answered with either “yes” or “no.” What is the smallest number of questions for which this can be guaranteed (provided that the questions are answered correctly)?
In a communication system consisting of 2001 subscribers, each subscriber is connected with exactly \(n\) others. Determine all the possible values of \(n\).
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.
There are two purses and one coin. Inside the first purse is one coin, and inside the second purse is one coin. How can this be?
Reception pupil Peter knows only the number 1. Prove that he can write a number divisible by 2001.