In some state, there are 101 cities.
a) Each city is connected to each of the other cities by one-way roads, and 50 roads lead into each city and 50 roads lead out of each city. Prove that you can get from each city to any other, having travelled on no more than on two roads.
b) Some cities are connected by one-way roads, and 40 roads lead into each city and 40 roads lead out of each. Prove that you can get form each city to any other, having travelled on no more than on three roads.
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.
Solve the equation in integers \(2x + 5y = xy - 1\).
Prove there are no integer solutions for the equation \(x^2 + 1990 = y^2\).
Recall that a natural number \(x\) is called prime if \(x\) has no divisors except \(1\) and itself. Solve the equation with prime numbers \(pqr = 7(p + q + r)\).
Solve the equation with natural numbers \(1 + x + x^2 + x^3 = 2y\).
Some person \(A\) thought of a number from 1 to 15. Some person \(B\) asks some questions to which you can answer ‘yes’ or ‘no’. Can \(B\) guess the number by asking a) 4 questions; b) 3 questions.
a) In a group of 4 people, who speak different languages, any three of them can communicate with one another; perhaps by one translating for two others. Prove that it is always possible to split them into pairs so that the two members of every pair have a common language.
b) The same, but for a group of 100 people.
c) The same, but for a group of 102 people.