Let \(M\) be a finite set of numbers. It is known that among any three of its elements there are two, the sum of which belongs to \(M\).
What is the largest number of elements in \(M\)?
Each of the three cutlets should be fried in a pan on both sides for five minutes each side. Only two cutlets can fit onto the frying pan. Is it possible to fry all three cutlets more quickly than in 20 minutes (if the time to turn over and transfer the cutlets is neglected)?
An area of airspace contains clouds. It turns out that the area can be divided by 10 aeroplanes into regions such that each region contains no more than one cloud. What is the largest number of clouds an aircraft can fly through whilst holding a straight line course.
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)?
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?