Let \(x_1, x_2, \dots , x_n\) be some numbers belonging to the interval \([0, 1]\). Prove that on this segment there is a number \(x\) such that \[\frac{1}{n} (|x - x_1| + |x - x_2| + \dots + |x - x_n|) = 1/2.\]
51 points were thrown into a square of side 1 m. Prove that it is possible to cover some set of 3 points with a square of side 20 cm.
Prove that amongst numbers written only using the number 1, i.e.: 1, 11, 111, etc, there is a number than is divisible by 1987.
Prove that there is a power of 3 that ends in 001.
The numbers \(1, 2, \dots , 9\) are divided into three groups. Prove that the product of the numbers in one of the groups will always be no less than 72.
Prove that in any group of 10 whole numbers there will be a few whose sum is divisible by 10.
11 scouts are working on 5 different badges. Prove that there will be two scouts \(A\) and \(B\), such that every badge that \(A\) is working towards is also being worked towards by \(B\).
Let \(p\) be a prime number, and \(a\) an integer number not divisible by \(p\). Prove that there is a positive integer \(b\) such that \(ab \equiv 1 \pmod p\).
30 people vote on five proposals. In how many ways can the votes be distributed if everyone votes only for one proposal and only the number of votes cast for each proposal is taken into account?
Each of the 102 pupils of one school is friends with at least 68 others. Prove that among them there are four who have the same number of friends.