Olympiad problems

2017 Australian MO, 1

Determine all polynomial $P(x)\in \mathbb{R}[x]$ satisfying the following two conditions: (a) $P(2017)=2016$ and (b) $(P(x)+1)^2=P(x^2+1)$ for all real number $x$.

2005 Federal Competition For Advanced Students, Part 2, 3

Tags: geometry , Austria , AUT

Triangle $DEF$ is acute. Circle $c_1$ is drawn with $DF$ as its diameter and circle $c_2$ is drawn with $DE$ as its diameter. Points $Y$ and $Z$ are on $DF$ and $DE$ respectively so that $EY$ and $FZ$ are altitudes of triangle $DEF$ . $EY$ intersects $c_1$ at $P$, and $FZ$ intersects $c_2$ at $Q$. $EY$ extended intersects $c_1$ at $R$, and $FZ$ extended intersects $c_2$ at $S$. Prove that $P$, $Q$, $R$, and $S$ are concyclic points.

2018 Regional Competition For Advanced Students, 2

Tags: geometry , Equilateral Triangle , perpendicular bisector , Chords , Austria , national olympiad , AUT

Let $k$ be a circle with radius $r$ and $AB$ a chord of $k$ such that $AB > r$. Furthermore, let $S$ be the point on the chord $AB$ satisfying $AS = r$. The perpendicular bisector of $BS$ intersects $k$ in the points $C$ and $D$. The line through $D$ and $S$ intersects $k$ for a second time in point $E$. Show that the triangle $CSE$ is equilateral. [i]Proposed by Stefan Leopoldseder[/i]

2018 Federal Competition For Advanced Students, P1, 1

Tags: inequalities , Austria , AUT

Let $\alpha$ be an arbitrary positive real number. Determine for this number $\alpha$ the greatest real number $C$ such that the inequality$$\left(1+\frac{\alpha}{x^2}\right)\left(1+\frac{\alpha}{y^2}\right)\left(1+\frac{\alpha}{z^2}\right)\geq C\left(\frac{x}{z}+\frac{z}{x}+2\right)$$ is valid for all positive real numbers $x, y$ and $z$ satisfying $xy + yz + zx =\alpha.$ When does equality occur? [i](Proposed by Walther Janous)[/i]

2017 Australian MO, 3

Tags: combinatorics , Combinatorial games , game strategy , game , Austria , AUT

Anna and Berta play a game in which they take turns in removing marbles from a table. Anna takes the first turn. When at the beginning of the turn there are $n\geq 1$ marbles on the table, then the player whose turn it is removes $k$ marbles, where $k\geq 1$ either is an even number with $k\leq \frac{n}{2}$ or an odd number with $\frac{n}{2}\leq k\leq n$. A player win the game if she removes the last marble from the table. Determine the smallest number $N\geq 100000$ such that Berta can enforce a victory if there are exactly $N$ marbles on the tale in the beginning.

2004 Regional Competition For Advanced Students, 1

Tags: number theory , AUT , Austria , Diophantine equation

Determine all integers $ a$ and $ b$, so that $ (a^3\plus{}b)(a\plus{}b^3)\equal{}(a\plus{}b)^4$

2015 Federal Competition For Advanced Students, P2, 5

Tags: geometry , incenter , Austria , AUT

Let I be the incenter of triangle $ABC$ and let $k$ be a circle through the points $A$ and $B$. The circle intersects * the line $AI$ in points $A$ and $P$ * the line $BI$ in points $B$ and $Q$ * the line $AC$ in points $A$ and $R$ * the line $BC$ in points $B$ and $S$ with none of the points $A,B,P,Q,R$ and $S$ coinciding and such that $R$ and $S$ are interior points of the line segments $AC$ and $BC$, respectively. Prove that the lines $PS$, $QR$, and $CI$ meet in a single point. (Stephan Wagner)

2017 Regional Competition For Advanced Students, 3

Tags: combinatorics , Austria , AUT

The nonnegative integers $2000$, $17$ and $n$ are written on the blackboard. Alice and Bob play the following game: Alice begins, then they play in turns. A move consists in replacing one of the three numbers by the absolute difference of the other two. No moves are allowed, where all three numbers remain unchanged. The player who is in turn and cannot make an allowed move loses the game. [list] [*] Prove that the game will end for every number $n$. [*] Who wins the game in the case $n = 2017$? [/list] [i]Proposed by Richard Henner[/i]

2013 Federal Competition For Advanced Students, Part 1, 2

Tags: algebra , polynomial , function , Rational Root Theorem , Austria , 2013 , AUT

Solve the following system of equations in rational numbers: \[ (x^2+1)^3=y+1,\\ (y^2+1)^3=z+1,\\ (z^2+1)^3=x+1.\]

2011 Regional Competition For Advanced Students, 1

Tags: number theory proposed , number theory , AUT , Austria

Let $p_1, p_2, \ldots, p_{42}$ be $42$ pairwise distinct prime numbers. Show that the sum \[\sum_{j=1}^{42}\frac{1}{p_j^2+1}\] is not a unit fraction $\frac{1}{n^2}$ of some integer square number.