At a conference there are 50 scientists, each of whom knows at least 25 other scientists at the conference. Prove that is possible to seat four of them at a round table so that everyone is sitting next to people they know.
Each of the 102 pupils of one school is friends with at least 68 others. Prove that among them there are four who have the same number of friends.
Each of the edges of a complete graph consisting of 6 vertices is coloured in one of two colours. Prove that there are three vertices, such that all the edges connecting them are the same colour.
Eugenie, arriving from Big-island, said that there are several lakes connected by rivers. Three rivers flow from each lake, and four rivers flow into each lake. Prove that she is wrong.
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 what number system is the equality \(3 \times 4 = 10\) correct?
Prove that any axis of symmetry of a 45-gon passes through its vertex.
Is the number \(1 + 2 + 3 + \dots + 1990\) odd or even?
Every Martian has three hands. Can seven Martians join hands?
At the vertices of a \(n\)-gon are the numbers \(1\) and \(-1\). On each side is written the product of the numbers at its ends. It turns out that the sum of the numbers on the sides is zero. Prove that a) \(n\) is even; b) \(n\) is divisible by 4.