Documents

Problem I-1

Let n2n \geq 2 be an integer and x1,x2,,xnx_1, x_2, \ldots, x_n be real numbers satisfying

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

(b) x1+x2++xn=nx_1 + x_2 + \cdots + x_n = n.

Prove the inequality j=1n11+xjj=1nxj1+xj2\sum_{j=1}^n \frac{1}{1 + x_j} \geq \sum_{j=1}^n \frac{x_j}{1 + x_j^2}

and determine when equality holds.

Problem I-2

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

Show that an infinite sequence of moves cannot exist.

Problem I-3

Let ABCABC be an acute-angled triangle with BAC>45°\measuredangle BAC > 45° and with circumcentre OO. The point PP lies in its interior such that the points A,P,O,BA, P, O, B lie on a circle and BPBP is perpendicular to CPCP. The point QQ lies on the segment BPBP such that AQAQ is parallel to POPO.

Prove that QCB=PCO\measuredangle QCB = \measuredangle PCO.

Problem I-4

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

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

Problem T-1

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

Problem T-2

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

Problem T-3

A tract of land in the shape of an 8×88 \times 8 square, whose sides are oriented north-south and east-west, consists of 6464 smaller 1×11 \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×11 \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.

Problem T-4

A class of high school students wrote a test. Every question was graded as either 11 point for a correct answer or 00 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.

Problem T-5

Let ABCABC be an acute-angled triangle with ABACAB \neq AC, and let OO be its circumcentre. The line AOAO intersects the circumcircle ω\omega of ABCABC a second time in point DD, and the line BCBC in point EE. The circumcircle of CDECDE intersects the line CACA a second time in point PP. The line PEPE intersects the line ABAB in point QQ. The line through OO parallel to PEPE intersects the altitude of the triangle ABCABC that passes through AA in point FF.

Prove that FP=FQFP = FQ.

Problem T-6

Let ABCABC be a triangle with ABACAB \neq AC. The points K,L,MK, L, M are the midpoints of the sides BC,CA,ABBC, CA, AB, respectively. The inscribed circle of ABCABC with centre II touches the side BCBC at point DD. The line gg, which passes through the midpoint of segment IDID and is perpendicular to IKIK, intersects the line LMLM at point PP.

Prove that PIA=90\measuredangle PIA = 90^{\circ}.

Problem T-7

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

Prove:

(a) All Mozartian numbers are even.

(b) There are infinitely many Mozartian numbers.

Problem T-8

We consider the equation a2+b2+c2+n=abca^2 + b^2 + c^2 + n = abc, where a,b,ca, b, c are positive integers.

Prove:

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

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

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