Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying \begin{align*} f(x+f(y)) &= g(x) + h(y) \\ g(x+g(y)) &= h(x) + f(y) \\ h(x+h(y)) &= f(x) + g(y) \end{align*} for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.) [i]Proposed by Evan Chen[/i]

A polynomial $f(x)$ of degree $2000$ is given. It's known that $f(x^2-1)$ has exactly $3400$ real roots while $f(1-x^2)$ has exactly $2700$ real roots. Prove that there exist two real roots of $f(x)$ such that the difference between them is less that $0.002$. [i](А. Солынин)[/i] [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Prove that given three positive numbers, we can choose two of them, say $x$ and $y,$ with $x >y$ such that $$\frac{x-y}{1 +xy }<1.$$ Prove also that if the number $1$ that appears in the second member of the previous inequality is replaced by a lower number, even if very close to $1$, the previous proposition is false.

Let $\{x_n\}$ be a sequence defined by $x_1 = 2$ and $x_{n+1} = x_n^2 - x_n + 1$ for $n \ge 1$. Prove that $$1 -\frac{1}{2^{2^{n-1}}} < \frac{1}{x_1}+\frac{1}{x_2}+ ... +\frac{1}{x_n}< 1 -\frac{1}{2^{2^n}}$$ for all $n$

Let $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to \mathbb N$ such that for every $m,n\in \mathbb N$, \[ f(m)+f(n)\mid m+n. \]

Alexandre and Herculano are at Campanha station waiting for the train. To entertain themselves, they decide to calculate the length of a freight train that passes through the station without changing its speed. When the front of the train passes them, Alexandre starts walking in the direction of the train's movement and Herculano starts walking in the opposite direction. The two walk at the same speed and each of them stops at the moment they cross the end of the train. Alexandre walked $45$ meters and Herculano $30$. How long is the train?

Let $r_1, r_2, ..., r_{2021}$ be the not necessarily real and not necessarily distinct roots of $x^{2022} + 2021x = 2022$. Let $S_i = r_i^{2021}+2022r_i$ for all $1 \le i \le 2021$. Find $\left|\sum^{2021}_{i=1} S_i \right| = |S_1 +S_2 +...+S_{2021}|$.

11. Let $f(z)=\frac{a z+b}{c z+d}$ for $a, b, c, d \in \mathbb{C}$. Suppose that $f(1)=i, f(2)=i^{2}$, and $f(3)=i^{3}$. If the real part of $f(4)$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m, n$, find $m^{2}+n^{2}$.

The fourth-degree polynomial $P(x)$ is such that the equation $P(x)=x$ has $4$ roots, and any equation of the form $P(x)=c$ has no more two roots. Prove that the equation $P(x)=-x$ too has no more than two roots.

Given the $6$ digits: $0, 1, 2, 3, 4, 5$. Find the sum of all even four-digit numbers which can be expressed with the help of these figures (the same figure can be repeated).

Given that $\{a_n\}$ is a sequence of integers satisfying the following condition for all positive integral values of $n$: $a_n+a_{n+1}=2a_{n+2}a_{n+3}+2016$. Find all possible values of $a_1$ and $a_2$

Positive real numbers $a_1, \dots, a_k, b_1, \dots, b_k$ are given. Let $A = \sum_{i = 1}^k a_i, B = \sum_{i = 1}^k b_i$. Prove the inequality \[ \left( \sum_{i = 1}^k \frac{a_i b_i}{a_i B + b_i A} - 1 \right)^2 \ge \sum_{i = 1}^k \frac{a_i^2}{a_i B + b_i A} \cdot \sum_{i = 1}^k \frac{b_i^2}{a_i B + b_i A}. \]

$a$ and $b$ are fixed real numbers. With $x_n$ we denote the sum of the digits of $an+b$ in the decimal number system. Prove that the sequence $x_n$ contains an infinite constant subsequence.

Let a$,b,c,d$ and $x,y,z,t$ be real numbers such that $0\le a,b,c,d \le 1$ , $x,y,z,t \ge 1$ and $a+b+c+d +x+y+z+t=8$. Prove that $a^2+b^2+c^2+d^2+x^2+y^2+z^2+t^2\le 28$

Find the smallest positive integer $N$ such that each of the $101$ intervals $$[N^2, (N+1)^2), [(N+1)^2, (N+2)^2), \cdots, [(N+100)^2, (N+101)^2)$$ contains at least one multiple of $1001.$ [i]Proposed by Kyle Lee[/i]

Let $a,b,c>1$. Solve in $\mathbb{R}$ the equation $\log_{a+b}(a^x+b)=\log_b((b+c)^x-c)$. [i]Mihai Opincariu[/i]

Prove that \[1+\frac{2^1}{1-2^1}+\frac{2^2}{(1-2^1)(1-2^2)}+\cdots+\frac{2^{2016}}{(1-2^1)\cdots(1-2^{2016})}>0.\]

Call a two-element subset of $\mathbb{N}$ [i]cute[/i] if it contains exactly one prime number and one composite number. Determine all polynomials $f \in \mathbb{Z}[x]$ such that for every [i]cute[/i] subset $ \{ p,q \}$, the subset $ \{ f(p) + q, f(q) + p \} $ is [i]cute[/i] as well. [i]Proposed by Valentio Iverson (Indonesia)[/i]

We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers. Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property: \[f(x)f(y)\equal{}2f(x\plus{}yf(x))\] for all positive real numbers $x$ and $y$. [i]Proposed by Nikolai Nikolov, Bulgaria[/i]

Find all $a\in\mathbb{R}$ for which there exists a non-constant function $f: (0,1]\rightarrow\mathbb{R}$ such that \[a+f(x+y-xy)+f(x)f(y)\leq f(x)+f(y)\] for all $x,y\in(0,1].$

[b]a)[/b] Show that there are infinitely many rational numbers $ x>0 $ such that $ \left\{ x^2 \right\} +\{ x \} =0.99. $ [b]b)[/b] Show that there are no rational numbers $ x>0 $ such that $ \left\{ x^2 \right\} +\{ x \} =1. $ $ \{\} $ denotes the usual fractional part.

Let $a, b, c$ be nonnegative real numbers with arithmetic mean $m =\frac{a+b+c}{3}$ . Provethat $$\sqrt{a+\sqrt{b + \sqrt{c}}} +\sqrt{b+\sqrt{c + \sqrt{a}}} +\sqrt{c +\sqrt{a + \sqrt{b}}}\le 3\sqrt{m+\sqrt{m + \sqrt{m}}}.$$

Sequence $ \{ f_n(a) \}$ satisfies $ \displaystyle f_{n\plus{}1}(a) \equal{} 2 \minus{} \frac{a}{f_n(a)}$, $ f_1(a) \equal{} 2$, $ n\equal{}1,2, \cdots$. If there exists a natural number $ n$, such that $ f_{n\plus{}k}(a) \equal{} f_{k}(a), k\equal{}1,2, \cdots$, then we call the non-zero real $ a$ a $ \textbf{periodic point}$ of $ f_n(a)$. Prove that the sufficient and necessary condition for $ a$ being a $ \textbf{periodic point}$ of $ f_n(a)$ is $ p_n(a\minus{}1)\equal{}0$, where $ \displaystyle p_n(x)\equal{}\sum_{k\equal{}0}^{\left[ \frac{n\minus{}1}{2} \right]} (\minus{}1)^k C_n^{2k\plus{}1}x^k$, here we define $ \displaystyle \frac{a}{0}\equal{} \infty$ and $ \displaystyle \frac{a}{\infty} \equal{} 0$.

A set $S$ is constructed as follows. To begin, $S=\{0,10\}$. Repeatedly, as long as possible, if $x$ is an integer root of some polynomial $a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ for some $n\geq 1$, all of whose coefficients $a_i$ are elements of $S$, then $x$ is put into $S$. When no more elements can be added to $S$, how many elements does $S$ have? $\textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 7 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 11$

Let $ d$ and $ e$ denote the solutions of $ 2x^2\plus{}3x\minus{}5\equal{}0$. What is the value of $ (d\minus{}1)(e\minus{}1)$? $ \textbf{(A)}\ \minus{}\frac{5}{2} \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$