In some country there is a capital and another 100 cities. Some cities (including the capital) are connected by one-way roads. From each non-capital city 20 roads emerge, and 21 roads enter each such city. Prove that you cannot travel to the capital from any city.
Prove that on the edges of a connected graph one can arrange arrows so that from some vertex one can reach any other vertex along the arrows.
In some country 89 roads emerge from the capital, from the city of Dalny – one road, from the remaining 1988 cities – 20 roads (in each).
Prove that from the capital you can drive to Dalny.
In a graph there are 100 vertices, and the degree of each of them is not less than 50. Prove that the graph is connected.
The faces of a polyhedron are coloured in two colours so that the neighbouring faces are of different colours. It is known that all of the faces except for one have a number of edges that is a multiple of 3. Prove that this one face has a multiple of 3 edges.
Can you find
a) in the 100th line of Pascal’s triangle, the number \(1 + 2 + 3 + \dots + 98 + 99\)?
b) in the 200th line the sum of the squares of the numbers in the 100th line?
On the dining room table, there is a choice of six dishes. Every day Valentina takes a certain set of dishes (perhaps, she does not take a single dish), and this set of dishes should be different from all of the sets that she took in the previous days. What is the maximum number of days that Valentina will be able to eat according to such rules and how many meals will she eat on average during the day?
Three people play table tennis, and the player who lost the game gives way to the player who did not participate in it. As a result, it turned out that the first player played 10 games and the second played 21 games. How many games did the third player play?
10 numbers are written around the circle, the sum of which is equal to 100. It is known that the sum of every three numbers standing side by side is not less than 29.
Specify the smallest number \(A\) such that in any such set of numbers each of the numbers does not exceed \(A\).
In a group of friends, each two people have exactly five common acquaintances. Prove that the number of pairs of friends is divisible by 3.