In the oriented graph, there are 101 vertices. For each vertex, the number of ingoing and outgoing edges is 40. Prove that from each vertex you can get to any other, having gone along no more than three edges.
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.
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.
a) What is the minimum number of pieces of wire needed in order to weld a cube’s frame?
b) What is the maximum length of a piece of wire that can be cut from this frame? (The length of the edge of the cube is 1 cm).
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).
Find the last digit of the number \(1 \times 2 + 2 \times 3 + \dots + 999 \times 1000\).
Is the number 12345678926 square?
Solve the equation in integers \(2x + 5y = xy - 1\).
Prove there are no integer solutions for the equation \(x^2 + 1990 = y^2\).
Prove there are no integer solutions for the equation \(4^k - 4^l = 10^n\).