Two people play the following game. Each player in turn rubs out 9 numbers (at his choice) from the sequence \(1, 2, \dots , 100, 101\). After eleven such deletions, 2 numbers will remain. The first player is awarded so many points, as is the difference between these remaining numbers. Prove that the first player can always score at least 55 points, no matter how played the second.
A six-digit phone number is given. How many seven-digit numbers are there from which one can obtain this six-digit number by deleting one digit?
The city plan is a rectangle of \(5 \times 10\) cells. On the streets, a one-way traffic system is introduced: it is allowed to go only to the right and upwards. How many different routes lead from the bottom left corner to the upper right?
27 coins are given, of which one is a fake, and it is known that a counterfeit coin is lighter than a real one. How can the counterfeit coin be found from 3 weighings on the scales without weights?
Two people toss a coin: one tosses it 10 times, the other – 11 times. What is the probability that the second person’s coin showed heads more times than the first?
There are 30 students in the class. Prove that the probability that some two students have the same birthday is more than 50%.
Are there any irrational numbers \(a\) and \(b\) such that the degree of \(a^b\) is a rational number?
Construct a function defined at all points on a real line which is continuous at exactly one point.
Every point in a plane, which has whole-number co-ordinates, is plotted in one of \(n\) colours. Prove that there will be a rectangle made out of 4 points of the same colour.
Prove that multiplying the polynomial \((x + 1)^{n-1}\) by any polynomial different from zero, we obtain a polynomial having at least \(n\) nonzero coefficients.