Problems

Age
Difficulty
Found: 2291

Prove that for any natural number \(a_1> 1\) there exists an increasing sequence of natural numbers \(a_1, a_2, a_3, \dots\), for which \(a_1^2+ a_2^2 +\dots+ a_k^2\) is divisible by \(a_1+ a_2+\dots+ a_k\) for all \(k \geq 1\).

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?

At all rational points of the real line, integers are arranged. Prove that there is a segment such that the sum of the numbers at its ends does not exceed twice the number on its middle.

Find all the functions \(f\colon \mathbb {R} \rightarrow \mathbb {R}\) which satisfy the inequality \(f (x + y) + f (y + z) + f (z + x) \geq 3f (x + 2y + 3z)\) for all \(x, y, z\).

We are given a convex 200-sided polygon in which no three diagonals intersect at the same point. Each of the diagonals is coloured in one of 999 colours. Prove that there is some triangle inside the polygon whose sides lie some of the diagonals, so that all 3 sides are the same colour. The vertices of the triangle do not necessarily have to be the vertices of the polygon.

Prove that for all \(x \in (0;\pi /2)\) for \(n > m\), where \(n, m\) are natural, we have the inequality \(2 | \sin^n x-\cos^n x | \leq 3 | \sin^m x-\cos^m x |\);

Is it possible to arrange natural numbers from 1 to \(2002^2\) in the cells of a \(2002\times2002\) table so that for each cell of this table one could choose a triplet of numbers, from a row or column, where one of the numbers is equal to the product of the other two?

A number set \(M\) contains \(2003\) distinct positive numbers, such that for any three distinct elements \(a, b, c\) in \(M\), the number \(a^2 + bc\) is rational. Prove that we can choose a natural number \(n\) such that for any \(a\) in \(M\) the number \(a\sqrt{n}\) is rational.