A class contains 33 pupils, who have a combined age of 430 years. Prove that if we picked the 20 oldest pupils they would have a combined age of no less than 260 years. The age of any given pupil is a whole number.
In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).
Find the largest value of the expression \(a + b + c + d - ab - bc - cd - da\), if each of the numbers \(a\), \(b\), \(c\) and \(d\) belongs to the interval \([0, 1]\).
A polynomial of degree \(n > 1\) has \(n\) distinct roots \(x_1, x_2, \dots , x_n\). Its derivative has the roots \(y_1, y_2, \dots , y_{n-1}\). Prove the inequality \[\frac{x_1^2 + \dots + x_n^2}{n}> \frac{y_1^2 + \dots + y_n^2}{n}.\]
A function \(f\) is given, defined on the set of real numbers and taking real values. It is known that for any \(x\) and \(y\) such that \(x > y\), the inequality \((f (x)) ^2 \leq f (y)\) is true. Prove that the set of values generated by the function is contained in the interval \([0,1]\).
The numerical function \(f\) is such that for any \(x\) and \(y\) the equality \(f (x + y) = f (x) + f (y) + 80xy\) holds. Find \(f(1)\) if \(f(0.25) = 2\).
Each day, from Monday to Friday, an old man went to the sea and threw in a net to catch fish. On each day the man caught no more fish than on the previous day. In total over the 5 days the man caught exactly 100 fish. What is the minimum total number of fish the man could have caught on Monday, Wednesday, and Friday.
Author: I.I. Bogdanov
Peter wants to write down all of the possible sequences of 100 natural numbers, in each of which there is at least one 4 or 5, and any two neighbouring terms differ by no more than 2. How many sequences will he have to write out?
A carpet has a square shape with side 275 cm. A moth has eaten 4 holes through it. Will it always be possible to cut a square section of side 1 m out of the carpet, so that the section does not contain any holes? Treat the holes as points.
A unit square is divided into \(n\) triangles. Prove that one of the triangles can be used to completely cover a square with side length \(\frac{1}{n}\).