An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ [i]Shiny[/i] if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have $$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$ Find the largest constant $K = K(n)$ such that $$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$ holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.

[b]a)[/b] Let be an even number $ n\ge 4 $ and $ n $ positive real numbers $ x_1,x_2,\ldots ,x_n. $ Prove that: $$ \min_{1\le i\le n/2} \frac{x_i}{x_{i+n/2}}\le \frac{x_1+x_2+\cdots +x_{n/2}}{x_{1+n/2}+ x_{2+n/2} +\cdots + x_n}\le \max_{1\le i\le n/2} \frac{x_i}{x_{i+n/2}}$$ [b]b)[/b] Let be $ m\ge 1 $ pairwise distinct natural numbers $ a,b,\ldots ,c. $ Show that: $$ \frac{ab\cdots c}{a+b+\cdots +c}\ge (m-1)!\cdot\frac{2}{m+1} $$ [i]M. Tetiva[/i]

In a class, there are $n \geqslant 3$ students and a teacher with $M$ marbles. The teacher then play a [i]Marble distribution[/i] according to the following rules. At the start, the teacher distributed all her marbles to students, so that each student receives at least $1$ marbles from the teacher. Then, the teacher chooses a student , who has never been chosen before, such that the number of marbles that he owns in a multiple of $2(n-1)$. That chosen student then equally distribute half of his marbles to $n-1$ other students. The same goes on until the teacher is not able to choose anymore student. Find all integer $M$, such that for some initial numbers of marbles that the students receive, the teacher can choose all the student(according to the rule above), so that each student receiving equal amount of marbles at the end.

Let $ ABCD$ be an isosceles trapezium. Determine the geometric location of all points $ P$ such that \[ |PA| \cdot |PC| \equal{} |PB| \cdot |PD|.\]

The two circles $\Gamma_1$ and $\Gamma_2$ with the midpoints $O_1$ resp. $O_2$ intersect in the two distinct points $A$ and $B$. A line through $A$ meets $\Gamma_1$ in $C \neq A$ and $\Gamma_2$ in $D \neq A$. The lines $CO_1$ and $DO_2$ intersect in $X$. Prove that the four points $O_1,O_2,B$ and $X$ are concyclic.

Find all functions $f:\mathbb{R}\to \mathbb{R},g:\mathbb{R}\to \mathbb{R}$ such that $$f(x-2f(y))= xf(y)-yf(x)+g(x)$$ for all real $x,y$

Points $H$ and $L$ are, respectively, the feet of the altitude and the angle bisector drawn from the vertex $A$ of the triangle $ABC$, $K$ is the touchpoint of the circle inscribed in the triangle $ABC$ with the side $BC$. Under what conditions will $AK$ be the bisector of the angle $\angle LAH$? (Hryhorii Filippovskyi)

Let $\triangle ABC$ be an acute angled triangle and let $k$ be its circumscribed circle. A point $O$ is given in the interior of the triangle, such that $CE=CF$, where $E$ and $F$ are on $k$ and $E$ lies on $AO$ while $F$ lies on $BO$. Prove that $O$ is on the angle bisector of $\angle ACB$ if and only if $AC=BC$.

A circle with center $O$ has radius $5,$ and has two points $A,B$ on the circle such that $\angle AOB = 90^{\circ}.$ Rays $OA$ and $OB$ are extended to points $C$ and $D,$ respectively, such that $AB$ is parallel to $CD,$ and the length of $CD$ is $200\%$ more than the radius of circle $O.$ Determine the length of $AC.$

In every vertex of a regular $n$ -gon exactly one chip is placed. At each $step$ one can exchange any two neighbouring chips. Find the least number of steps necessary to reach the arrangement where every chip is moved by $[\frac{n}{2}]$ positions clockwise from its initial position.

Let $ a_{0},a_{1},\ldots,a_{n}$ be integers, one of which is nonzero, and all of the numbers are not less than $ \minus{} 1$. Prove that if \[ a_{0} \plus{} 2a_{1} \plus{} 2^{2}a_{2} \plus{} \cdots \plus{} 2^{n}a_{n} \equal{} 0,\] then $ a_{0} \plus{} a_{1} \plus{} \cdots \plus{} a_{n} > 0$.

The pentagons $P_1P_2P_3P_4P_5$ and$I_1I_2I_3I_4I_5$ are cyclic, where $I_i$ is the incentre of the triangle $P_{i-1}P_iP_{i+1}$ (reckoned cyclically, that is $P_0=P_5$ and $P_6=P_1$). Show that the lines $P_1I_1, P_2I_2, P_3I_3, P_4I_4$ and $P_5I_5$ meet in a single point.

Consider the sequence $(3^{2^n} + 1)_{n\geq 1}$. i) Prove there exist infinitely many primes, none dividing any term of the sequence. ii) Prove there exist infinitely many primes, each dividing some term of the sequence. [i](Dan Schwarz)[/i]

The sum of $n$ terms of an arithmetic progression is $153$, and the common difference is $2$. If the first interm is an integer, and $n>1$, then the number of possible values for $n$ is: $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6 $

Chim Tu has a large rectangular table. On it, there are finitely many pieces of paper with nonoverlapping interiors, each one in the shape of a convex polygon. At each step, Chim Tu is allowed to slide one piece of paper in a straight line such that its interior does not touch any other piece of paper during the slide. Can Chim Tu always slide all the pieces of paper off the table in finitely many steps?

Find all real quadruples $(a,b,c,d)$ satisfying the system of equations $$ \left\{ \begin{array}{ll} ab+cd = 6 \\ ac + bd = 3 \\ ad + bc = 2 \\ a + b + c + d = 6. \end{array} \right. $$

For how many values of $ a$ is it true that the line $ y \equal{} x \plus{} a$ passes through the vertex of the parabola $ y \equal{} x^2 \plus{} a^2$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ 2\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ \text{infinitely many}$

In triangle $ABC$ points $P$ and $Q$ lies on the external bisector of $\angle A$ such that $B$ and $P$ lies on the same side of $AC$. Perpendicular from $P$ to $AB$ and $Q$ to $AC$ intersect at $X$. Points $P'$ and $Q'$ lies on $PB$ and $QC$ such that $PX=P'X$ and $QX=Q'X$. Point $T$ is the midpoint of arc $BC$ (does not contain $A$) of the circumcircle of $ABC$. Prove that $P',Q'$ and $T$ are collinear if and only if $\angle PBA+\angle QCA=90^{\circ}$.

Let $a_0,a_1,a_2,...$ be an infinite sequence of positive integers such that $a_0 = 1$ and $a_i^2 > a_{i-1}a_{i+1}$ for all $i > 0$. (a) Prove that $a_i < a_1^i$ for all $i > 1$. (b) Prove that $a_i > i$ for all $i$.

Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$. [i]Nanang Susyanto, Jogjakarta[/i]

In the diagram below, $BP$ bisects $\angle ABC$, $CP$ bisects $\angle BCA$, and $PQ$ is perpendicular to $BC$. If $BQ\cdot QC=2PQ^2$, prove that $AB+AC=3BC$. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvOC8zL2IwZjNjMDAxNWEwMTc1ZGNjMTkwZmZlZmJlMGRlOGRhYjk4NzczLnBuZw==&rn=VlRSTUMgMjAwNi5wbmc=[/img]

[b](a)[/b] Prove that every positive integer $n$ can be written uniquely in the form \[n=\sum_{j=1}^{2k+1}(-1)^{j-1}2^{m_j},\] where $k\geq 0$ and $0\le m_1<m_2\cdots <m_{2k+1}$ are integers. This number $k$ is called [i]weight[/i] of $n$. [b](b)[/b] Find (in closed form) the difference between the number of positive integers at most $2^{2017}$ with even weight and the number of positive integers at most $2^{2017}$ with odd weight.

Let $A$, $M$, and $C$ be nonnegative integers such that $A+M+C=10$. What is the maximum value of $A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A$? $\text{(A)}\ 49 \qquad\text{(B)}\ 59 \qquad\text{(C)}\ 69 \qquad\text{(D)}\ 79\qquad\text{(E)}\ 89$

Let $A,B$ be matrices of dimension $2010\times2010$ which commute and have real entries, such that $A^{2010}=B^{2010}=I$, where $I$ is the identity matrix. Prove that if $\operatorname{tr}(AB)=2010$, then $\operatorname{tr}(A)=\operatorname{tr}(B)$.

Let $ABC$ be a triangle. Let $\Omega$ be the brocard point. Prove that $\left(\frac{A\Omega}{BC}\right)^2+\left(\frac{B\Omega}{AC}\right)^2+\left(\frac{C\Omega}{AB}\right)^2\ge 1$