olymmath

AT-OEMO-FED1 2021

Austrian Mathematical Olympiad, Federal Competition Part 1 2021.

Other problems

Problem 1

Let a,b,c≥0a,b,c\geq 0 and a+b+c=1.a+b+c=1. Prove that a2a+1+b3b+1+c6c+1≤12.\frac{a}{2a+1}+\frac{b}{3b+1}+\frac{c}{6c+1}\leq \frac{1}{2}. (Marian Dinca)

Problem 2

Let ABCABC denote a triangle. The point XX lies on the extension of ACAC beyond AA , such that AX=ABAX = AB . Similarly, the point YY lies on the extension of BCBC beyond BB such that BY=ABBY = AB . Prove that the circumcircles of ACYACY and BCXBCX intersect a second time in a point different from CC that lies on the bisector of the angle ∠BCA\angle BCA .

(Theresia Eisenkölbl)

Problem 3

Let n≥3n \ge 3 be an integer. On a circle, there are nn points. Each of them is labelled with a real number at most 11 such that each number is the absolute value of the difference of the two numbers immediately preceding it in clockwise order. Determine the maximal possible value of the sum of all numbers as a function of nn .

(Walther Janous)

Problem 4

On a blackboard, there are 1717 integers not divisible by 1717 . Alice and Bob play a game. Alice starts and they alternately play the following moves: ∙\bullet Alice chooses a number aa on the blackboard and replaces it with a2a^2 ∙\bullet Bob chooses a number bb on the blackboard and replaces it with b3b^3 . Alice wins if the sum of the numbers on the blackboard is a multiple of 1717 after a finite number of steps. Prove that Alice has a winning strategy.

(Daniel Holmes)