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.
There are 30 people, among which some are friends. Prove that the number of people who have an odd number of friends is even.
25 cells were coloured in on a sheet of squared paper. Can each of them have an odd number of coloured in neighbouring cells?
Can the degrees of vertices in the graph be equal to:
a) 8, 6, 5, 4, 4, 3, 2, 2?
b) 7, 7, 6, 5, 4, 2, 2, 1?
c) 6, 6, 6, 5, 5, 3, 2, 2?