Let $x, y, z$ be real numbers such that $$x+y+z=2, \;\;\;\; xy+yz+zx=1$$ Find the maximum possible value of $x-y$.

Determine the maximum value of the sum \[ \sum_{i < j} x_ix_j (x_i \plus{} x_j) \] over all $ n \minus{}$tuples $ (x_1, \ldots, x_n),$ satisfying $ x_i \geq 0$ and $ \sum^n_{i \equal{} 1} x_i \equal{} 1.$

Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.

Determine the minimal and maximal values the expression $\frac{|a+b|+|b+c|+|c+a|}{|a|+|b|+|c|}$ can take, where $a,b,c$ are real numbers.

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

In a triangle $ABC$, $T$ is the centroid and $ \angle TAB = \angle ACT$. Find the maximum possible value of $sin \angle CAT +sin \angle CBT$.

Find the maximum possible value of $k$ for which there exist distinct reals $x_1,x_2,\ldots ,x_k $ greater than $1$ such that for all $1 \leq i, j \leq k$, $$x_i^{\lfloor x_j \rfloor }= x_j^{\lfloor x_i\rfloor}.$$ [i]Proposed by Morteza Saghafian[/i]

There are $n$ stone piles each consisting of $2018$ stones. The weight of each stone is equal to one of the numbers $1, 2, 3, ...25$ and the total weights of any two piles are different. It is given that if we choose any two piles and remove the heaviest and lightest stones from each of these piles then the pile which has the heavier one becomes the lighter one. Determine the maximal possible value of $n$.

Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$ to $k^2$ (included), such that there are no such triangles having the same numbers. With vertices the points of the grid, regular hexagons are defined of sidelengths $1$ cm. We shall name as [i]value [/i] of the hexagon, the sum of the numbers that lie on the $6$ small equilateral triangles that the hexagon consists of . Find (in terms of the integer $k>4$) the maximum and the minimum value of the sum of the values of all hexagons .

For all integers $ {a}_{0},{a}_{1}, \cdot\cdot\cdot {a}_{100}$, find the maximum of ${a}_{5}-2{a}_{40}+3{a}_{60}-4{a}_{95} $ $\bigstar$ 1) ${a}_{0}={a}_{100}=0$ 2) for all $i=0,1,\cdot \cdot \cdot 99, $ $|{a}_{i+1}-{a}_{i}|\le1$ 3) $ {a}_{10}={a}_{90} $

There are $2n + 1$ tickets, each with a unique positive integer as the ticket number. It is known that the sum of all ticket numbers is more than $2330$, but the sum of any $n$ ticket numbers is at most $1165$. What is the maximum value of $n$?

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $a, b, c$ be nonzero real numbers such that $a + b + c = 0$. Determine the maximum possible value of $\frac{a^2b^2c^2}{ (a^2 + ab + b^2)(b^2 + bc + c^2)(c^2 + ca + a^2)}$ .

Given an equilateral triangle with sidelength $k$ cm. With lines parallel to it's sides, we split it into $k^2$ small equilateral triangles with sidelength $1$ cm. This way, a triangular grid is created. In every small triangle of sidelength $1$ cm, we place exactly one integer from $1$ to $k^2$ (included), such that there are no such triangles having the same numbers. With vertices the points of the grid, regular hexagons are defined of sidelengths $1$ cm. We shall name as [i]value [/i] of the hexagon, the sum of the numbers that lie on the $6$ small equilateral triangles that the hexagon consists of . Find (in terms of the integer $k>4$) the maximum and the minimum value of the sum of the values of all hexagons .

If $x$ and $y$ are real numbers, determine the greatest possible value of the expression $\frac{(x+1)(y+1)(xy+1)}{(x^2+1)(y^2+1)}$.

Given circle $\omega$ and point $D$ outside this circle. Find the following points $A, B$ and $C$ on the circle $\omega$ so that the $ABCD$ quadrilateral is convex and has the maximum possible area. Justify your answer.

Esmeralda writes $2n$ real numbers $x_1, x_2, \dots , x_{2n}$, all belonging to the interval $[0, 1]$, around a circle and multiplies all the pairs of numbers neighboring to each other, obtaining, in the counterclockwise direction, the products $p_1 = x_1x_2$, $p_2 = x_2x_3$, $\dots$ , $p_{2n} = x_{2n}x_1$. She adds the products with even indices and subtracts the products with odd indices. What is the maximum possible number Esmeralda can get?

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $0<\alpha<\beta <\gamma\in \mathbb{R}$. Let $K=\{(x,y,z)\in \mathbb{R}^{3}\;|\; x,y,z\geq 0\; \text{and}\; x^{\beta}+y^{\beta}+z^{\beta}=1\}$. Define $f:K\rightarrow \mathbb{R},\; (x,y,z)\mapsto x^{\alpha}+y^{\beta}+z^{\gamma}$. At what points of $K$ does $f$ assume its minimal and maximal values?

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $\omega \in \mathbb{C}$, and $\left | \omega \right | = 1$. Find the maximum length of $z = \left( \omega + 2 \right) ^3 \left( \omega - 3 \right)^2$.

Let $ABCD$ be a square of the plane $P$. Define the minimum and the maximum the value of the function $f: P \to R$ is given by $f (P) =\frac{PA + PB}{PC + PD}$

Let $x, y$ and $z$ be nonnegative real numbers satisfying the following conditions: (1) $x + cy \le 36$,(2) $2x+ 3z \le 72$, where $c$ is a given positive number. Prove that if $c \ge 3$ then the maximum of the sum $x + y + z$ is $36$, while if $c < 3$, the maximum of the sum is $24 + \frac{36}{c}$ .

Find the maximum and minimum of the expression \[ \max(a_1, a_2) + \max(a_2, a_3), + \dots + \max(a_{n-1}, a_n) + \max(a_n, a_1), \] where $(a_1, a_2, \dots, a_n)$ runs over the set of permutations of $(1, 2, \dots, n)$.