Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following. $f(xf(y)+yf(z)+zf(x))=yf(x)+zf(y)+xf(z)$

On the board a 20-digit number which have 10 ones and 10 twos in its decimal form is written. It is allowed to choose two different digits and to reverse the order of digits in the interval between them. Is it always possible to get a number divisible by 11 using such operations?

Let $a_{1}, \ldots, a_{n}$ be an infinite sequence of strictly positive integers, so that $a_{k} < a_{k+1}$ for any $k.$ Prove that there exists an infinity of terms $ a_{m},$ which can be written like $a_m = x \cdot a_p + y \cdot a_q$ with $x,y$ strictly positive integers and $p \neq q.$

Let $\mathbb{Z}^+$ be the set of positive integers. Determine all functions $f : \mathbb{Z}^+\to\mathbb{Z}^+$ such that $a^2+f(a)f(b)$ is divisible by $f(a)+b$ for all positive integers $a,b$.

In this problem, a [i]simple polygon[/i] is a polygon that does not intersect itself and has no holes, and a [i]side[/i] of a polygon is a maximal set of collinear, consecutive line segments in the polygon. In particular, we allow two or more consecutive vertices in a simple polygon to be identical, and three or more consecutive vertices in a simple polygon to be collinear. By convention, polygons must have at least three sides. A simple polygon is [i]convex[/i] if every one of its interior angles is $180^\circ$ degrees or less. A simple polygon is concave if it is not [i]convex[/i]. Let P be the plane. Prove or disprove each of the following statements: $(a)$ There exists a function $f : P \to P$ such that for all positive integers $n \geq 4$, if $v_1, v_2, \ldots , v_n$ are the vertices of a simple concave $n$-sided polygon in some order, then $f(v_1), f(v_2), \ldots, f(v_n)$ are the vertices of a simple convex polygon in some order (which may or may not have $n$ sides). $(b)$ There exists a function $f : P \to P$ such that for all positive integers $n \geq 4$, if $v_1, v_2, \ldots , v_n$ are the vertices of a simple convex $n$-sided polygon in some order, then $f(v_1), f(v_2), \ldots, f(v_n)$ are the vertices of a simple concave polygon in some order (which may or may not have $n$ sides).

Prove for irrational number $\alpha$ and positive integer $n$ that \[ \left( \alpha + \sqrt{\alpha^2 - 1} \right)^{1/n} + \left(\alpha - \sqrt{\alpha^2 - 1} \right)^{1/n} \] is irrational.

Prove that \[\sum_{k=0}^n\frac{2^{2^k}\cdot 2^{k+1}}{2^{2^k}+3^{2^k}}<4\] holds for all positive integers $n$. [i]Submitted by Béla Kovács, Szatmárnémeti[/i]

It is known about the function $f : R \to R$ that $\bullet$ $f(x) > f(y)$ for all real $x > y$ $\bullet$ $f(x) > x$ for all real $x$ $\bullet$ $f(2x - f (x)) = x$ for all real $x$. Prove that $f(x) = x + f(0)$ for all real numbers $x$.

It is known that each vertex of the convex polyhedron $P$ belongs to three different faces, and each vertex of $P$ can be dyed black and white, so that the two endpoints of each edge of $P$ are different colors. Proof: The interior of each edge of $P$ can be dyed red, yellow, and blue, so that the colors of the three edges connected to each vertex are different, and each face contains two colors of edges. [i]Created by Liang Xiao[/i]

We consider all functions $f: \mathbb{N} \rightarrow \mathbb{N}$ such that $f(f(n)+n)=n$ and $f(a+b-1) \leq f(a)+f(b)$ for all positive integers $a, b, n$. Prove that there are at most two values for $f(2022)$. $\textit {Proposed by Ilija Jovcheski}$

Let $a \neq b a,b \in \mathbb{R}$ such that $(x^2+20ax+10b)(x^2+20bx+10a)=0$ has no roots for $x$. Prove that $20(b-a)$ is not an integer.

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

There are 2 pizzerias in a town, with 2010 pizzas each. Two scientists $A$ and $B$ are taking turns ($A$ is first), where on each turn one can eat as many pizzas as he likes from one of the pizzerias or exactly one pizza from each of the two. The one that has eaten the last pizza is the winner. Which one of them is the winner, provided that they both use the best possible strategy?

Let $x_1, x_2, \ldots ,x_n(n\ge 2)$ be real numbers greater than $1$. Suppose that $|x_i-x_{i+1}|<1$ for $i=1, 2,\ldots ,n-1$. Prove that \[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots +\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}<2n-1\]

For every positive integer $k>1$ prove that there exist a real number $x$ so that for every positive integer $n<1398$: $$\left\{x^n\right\}<\left\{x^{n-1}\right\} \Longleftrightarrow k\mid n.$$ [i]Proposed by Mohammad Amin Sharifi[/i]