Srednjoeuropska matematička olimpijada 2016

[ 2016 | MEMO ]

Let n \geqslant 2 be an integer and x_1, x_2, \ldots, x_n be real numbers satisfying

(a) x_j > -1 for j = 1, 2, \ldots, n and

(b) x_1 + x_2 + \ldots + x_n = n

Prove the inequality \sum_{j = 1}^{n} \frac{1}{1+x_j} \geqslant \sum_{j = 1}^{n} \frac{x_j}{1+x_j^2} and determine when equality holds.

There are n \geqslant 3 positive integers written on a blackboard. A move consists of choosing three numbers a, b, c on the blackboard such that they are the sides of a non-degenerate non-equilateral triangle and replacing them by a + b - c, b + c - a and c + a - b.

Show that an infinite sequence of moves cannot exist.

Let ABC be an acute-angled triangle with |\angle{BAC}| > 45^{\circ} and with circumcentre O. The point P lies in its interior such that the points A, P, O, B lie on a circle and BP is perpendicular to CP. The point Q lies on the segment BP such that AQ is parallel to PO.

Prove that |\angle{QCB}| = |\angle{PCO}|.

Find all functions f : \mathbb{N} \to \mathbb{N} such that f(a) + f(b) divides 2(a + b - 1) for all a, b \in \mathbb{N}.

Remark: \mathbb{N} = \{1, 2, 3, \ldots\} denotes the set of positive integers.

Determine all triples (a, b, c) of real numbers satisfying the system of equations a^2 + ab + c = 0 b^2 + bc + a = 0 c^2 + ca + b = 0

Let \mathbb{R} denote the set of real numbers. Determine all functions f : \mathbb{R} \to \mathbb{R} such that f(x)f(y) = xf(f(y-x)) + xf(2x) + f(x^2) holds for all real numbers x and y.

A tract of land in the shape of an 8 \times 8 square, whose sides are oriented north–south and east–west, consists of 64 smaller 1 \times 1 square plots. There can be at most one house on each of the individual plots. A house can only occupy a single 1 \times 1 square plot.

A house is said to be blocked from sunlight if there are three houses on the plots immediately to its east, west and south.

What is the maximum number of houses that can simultaneously exist, such that none of them is blocked from sunlight?

Remark: By definition, houses on the east, west and south borders are never blocked from sunlight.

A class of high school students wrote a test. Every question was graded as either 1 point for a correct answer or 0 points otherwise. It is known that each question was answered correctly by at least one student and the students did not all achieve the same total score.

Prove that there was a question on the test with the following property: The students who answered the question correctly got a higher average test score than those who did not.

Let ABC be an acute-angled triangle with |AB| \neq |AC|, and let O be its circumcentre. The line AO intersects the circumcircle \omega of ABC a second time in point D, and the line BC in point E. The circumcircle of CDE intersects the line CA a second time in point P. The line PE intersects the line AB in point Q. The line through O parallel to PE intersects the altitude of the triangle ABC that passes through A in point F.

Prove that |FP| = |FQ|.

Let ABC be a triangle with |AB| \neq |AC|. The points K, L, M are the midpoints of the sides BC, CA, AB, respectively. The inscribed circle of ABC with centre I touches the side BC at point D. The line g, which passes through the midpoint of segment ID and is perpendicular to IK, intersects the line LM at point P.

Prove that |\angle{PIA}| = 90^{\circ}.

A positive integer n is called a Mozartian number if the numbers 1, 2, \ldots , n together contain an even number of each digit (in base 10).

Prove:

(a) All Mozartian numbers are even.
(b) There are infinitely many Mozartian numbers.

We consider the equation a^2 + b^2 + c^2 + n = abc, where a, b, c are positive integers.

Prove:

(a) There are no solutions (a, b, c) for n = 2017.

(b) For n = 2016, a must be divisible by 3 for every solution (a, b, c).

(c) The equation has infinitely many solutions (a, b, c) for n = 2016.