Problems

Age
Difficulty
Found: 2451

In the country called Orientation a one-way traffic system was introduced on all the roads, and each city can be reached from any other one by driving on no more than two roads. One road was closed for repairs but from every city it remained possible to get to any other. Prove that for every two cities this can still be done whilst driving on no more than 3 roads.

In what number system is the equality \(3 \times 4 = 10\) correct?

Prove that for \(a, b, c > 0\), the following inequality is valid: \(\left(\frac{a+b+c}{3}\right)^2 \ge \frac{ab+bc+ca}{3}\).

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.

In a circle, each member has one friend and one enemy. Prove that

a) the number of members is even.

b) the circle can be divided into two neutral circles.