10 natural numbers are written on a blackboard. Prove that it is always possible to choose some of these numbers and write “\(+\)” or “\(-\)” between them so that the resulting algebraic sum is divisible by 1001.
There are 101 buttons of 11 different colours. Prove that amongst them there are either 11 buttons of the same colour, or 11 buttons of different colours.
Prove that the equation \[a_1 \sin x + b_1 \cos x + a_2 \sin 2x + b_2 \cos 2x + \dots + a_n \sin nx + b_n \cos nx = 0\] has at least one root for any values of \(a_1 , b_1, a_2, b_2, \dots, a_n, b_n\).
Let \(f (x)\) be a polynomial about which it is known that the equation \(f (x) = x\) has no roots. Prove that then the equation \(f (f (x)) = x\) does not have any roots.
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.
Is it possible to fill an \(n\times n\) table with the numbers \(-1\), \(0\), \(1\), such that the sums of all the rows, columns, and diagonals are unique?
Prove that in any group of friends there will be two people who have the same number of friends.
In chess, ‘check’ is when the king is under threat of capture from another piece. What is the largest number of kings that it is possible to place on a standard \(8\times 8\) chess board so that no two check one another.
Solve the equation \(2x^x = \sqrt {2}\) for positive numbers.
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.