Problems

Age
Difficulty
Found: 1969

Prove that there is a vertex in the tree from which exactly one edge emerges (such a vertex is called a hanging top).

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 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.

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}\).

Prove that for \(x \geq 0\) the inequality is valid: \(2x + \frac {3}{8} \ge \sqrt[4]{x}\).