Problems

Age
Difficulty
Found: 2801

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?

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.

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?

How many ways can I schedule the first round of the Russian Football Championship, in which 16 teams are playing? (It is important to note who is the host team).

A raisin bag contains 2001 raisins with a total weight of 1001 g, and no raisin weighs more than 1.002 g.

Prove that all the raisins can be divided onto two scales so that they show a difference in weight not exceeding 1 g.