Problems

Age
Difficulty
Found: 1522

Prove that there is no graph with five vertices whose degrees are equal to 4, 4, 4, 4, 2.

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

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.