In a country, each two cities are connected with a one-way road.
Prove that there is a city from which you can drive to any other whilst travelling along no more than two roads.
Prove that in a bipartite planar graph \(E \geq 2F\), if \(E \geq 2\) (\(E\) is the number of edges, \(F\) is the number of regions).
12 teams played a volleyball tournament in one round. Two teams scored exactly 7 wins.
Prove that there are teams \(A\), \(B\), \(C\) where \(A\) won against \(B\), \(B\) won against \(C\), and \(C\) won against \(A\).
Find a natural number greater than one that occurs in the Pascal triangle a) more than three times; b) more than four times.
For which \(n > 3\), can a set of weights with masses of \(1, 2, 3, ..., n\) grams be divided into three groups of equal mass?
There are \(n\) cities in a country. Between each two cities an air service is established by one of two airlines. Prove that out of these two airlines at least one is such that from any city you can get to any other city whilst traveling on flights only of this airline.
In the secret service, there are \(n\) agents – 001, 002, ..., 007, ..., \(n\). The first agent monitors the one who monitors the second, the second monitors the one who monitors the third, etc., the nth monitors the one who monitors the first. Prove that \(n\) is an odd number.
Find the number of zeros in which the number \(11^{100} - 1\) ends.
You are given a table of size \(m \times n\) (\(m, n > 1\)). In it, the centers of all cells are marked. What is the largest number of marked centers that can be chosen so that no three of them are the vertices of a right triangle?
There are several cities (more than one) in a country; some pairs of cities are connected by roads. It is known that you can get from every city to any other city by driving along several roads. In addition, the roads do not form cycles, that is, if you leave a certain city on some road and then move so as not to pass along one road twice, it is impossible to return to the initial city. Prove that in this country there are at least two cities, each of which is connected by a road with exactly one city.