Find the smallest possible value of a real number $c$ such that for any $2012$-degree monic polynomial \[P(x)=x^{2012}+a_{2011}x^{2011}+\ldots+a_1x+a_0\] with real coefficients, we can obtain a new polynomial $Q(x)$ by multiplying some of its coefficients by $-1$ such that every root $z$ of $Q(x)$ satisfies the inequality \[ \left\lvert \operatorname{Im} z \right\rvert \le c \left\lvert \operatorname{Re} z \right\rvert. \]

A [i]slip[/i] on an integer $n\geq 2$ is an operation that consists in choosing a prime divisor $p$ of $n$ and replacing $n$ by $\frac{n+p^2}{p}.$ Starting with an arbitrary integer $n\geq 5$, we successively apply the slip operation on it. Show that one eventually reaches $5$, no matter the slips applied.

The sum of $2025$ non-negative real numbers is $1$. Prove that they can be organized in a circle in such a way that the sum of all the $2025$ products of pairs of neighbouring numbers isn't greater than $\frac{1}{2025}$.

Let \(n>1\) be an integer, and let \(x_1, x_2, ..., x_n\) be real numbers satisfying \(x_1, x_2, ..., x_n \in [0,n]\) with \(x_1x_2...x_n = (n-x_1)(n-x_2)...(n-x_n)\). Find the maximum value of \(y = x_1 + x_2 + ... + x_n\).

Let $A > 1$ and $B > 1$ be real numbers and (xn) be a sequence of numbers in the interval $[1,AB]$. Prove that there exists a sequence $(y_n)$ of numbers in the interval $[1,A]$ such that $$\frac{x_m}{x_n}\le B\frac{y_m}{y_n} \,\,\, for \,\,\, all \,\,\, m,n = 1,2,...$$

Let $ABC$ be a triangle with incenter $I$ and let $X$, $Y$ and $Z$ be the incenters of the triangles $BIC$, $CIA$ and $AIB$, respectively. Let the triangle $XYZ$ be equilateral. Prove that $ABC$ is equilateral too. [i]Proposed by Mirsaleh Bahavarnia, Iran[/i]

[color=darkred]Let $a$ , $b$ and $c$ be three complex numbers such that $a+b+c=0$ and $|a|=|b|=|c|=1$ . Prove that: \[3\le |z-a|+|z-b|+|z-c|\le 4,\] for any $z\in\mathbb{C}$ , $|z|\le 1\, .$[/color]

Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings: (1) $\sum_{v\in V} f(v)=|E|$; (2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$. Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.

If positive real numbers $x,y,z$ satisfies $x+y+z=3,$ prove that $$\sum_{\text{cyc}} y^2z^2<3+\sum_{\text{cyc}} yz.$$ [i]Proposed by Li4 and Untro368.[/i]

Let $ABC$ be a right triangle with $\angle{ACB}=90^{\circ}$. $D$ is a point on $AB$ such that $CD\perp AB$. If the area of triangle $ABC$ is $84$, what is the smallest possible value of $$AC^2+\left(3\cdot CD\right)^2+BC^2?$$ [i]2016 CCA Math Bonanza Lightning #2.3[/i]

Prove that if the real numbers $a,b$ and $c$ satisfy $a^2+b^2+c^2=3$ then \[\frac{a^2}{2+b+c^2}+\frac{b^2}{2+c+a^2}+\frac{c^2}{2+a+b^2}\ge\frac{(a+b+c)^2}{12}\] When does the inequality hold?

What is the minimum value of the expression $$xy+yz+zx+\frac 1x+\frac 2y+\frac 5z$$ where $x, y, z$ are positive real numbers?

For every real number $ b$ determine all real numbers $ x$ satisfying $ x\minus{}b\equal{} \sum_{k\equal{}0}^{\infty}x^k$.

Suppose, medians $m_a$ and $m_b$ of a triangle are orthogonal. Prove that: (a) The medians of the triangle correspond to the sides of a right-angled triangle. (b) If $a,b,c$ are the side-lengths of the triangle, then, the following inequality holds:\[5(a^2+b^2-c^2)\geq 8ab\]

Assume there are $ n\ge3$ points in the plane, Prove that there exist three points $ A,B,C$ satisfying $ 1\le\frac{AB}{AC}\le\frac{n\plus{}1}{n\minus{}1}.$

Given a sequence $a_1,a_2,\ldots $ of non-negative real numbers satisfying the conditions: 1. $a_n + a_{2n} \geq 3n$; 2. $a_{n+1}+n \leq 2\sqrt{a_n \left(n+1\right)}$ for all $n\in\mathbb N$ (where $\mathbb N=\left\{1,2,3,...\right\}$). (1) Prove that the inequality $a_n \geq n$ holds for every $n \in \mathbb N$. (2) Give an example of such a sequence.

Find all lists $(x_1, x_2, \ldots, x_{2020})$ of non-negative real numbers such that the following three conditions are all satisfied: [list] [*] $x_1 \le x_2 \le \ldots \le x_{2020}$; [*] $x_{2020} \le x_1 + 1$; [*] there is a permutation $(y_1, y_2, \ldots, y_{2020})$ of $(x_1, x_2, \ldots, x_{2020})$ such that $$\sum_{i = 1}^{2020} ((x_i + 1)(y_i + 1))^2 = 8 \sum_{i = 1}^{2020} x_i^3.$$ [/list] [i]A permutation of a list is a list of the same length, with the same entries, but the entries are allowed to be in any order. For example, $(2, 1, 2)$ is a permutation of $(1, 2, 2)$, and they are both permutations of $(2, 2, 1)$. Note that any list is a permutation of itself.[/i]

$x, y, z$ are positive reals less than $1$. Show that at least one of $(1 - x)y$, $(1 - y)z$ and $(1 - z)x$ does not exceed $\frac14$ .

Let $n\geq 2$ is positive integer. Find the best constant $C(n)$ such that \[\sum_{i=1}^{n}x_{i}\geq C(n)\sum_{1\leq j<i\leq n}(2x_{i}x_{j}+\sqrt{x_{i}x_{j}})\] is true for all real numbers $x_{i}\in(0,1),i=1,...,n$ for which $(1-x_{i})(1-x_{j})\geq\frac{1}{4},1\leq j<i \leq n.$

Let $ABC$ be a triangle. For some $d>0$ let $P$ stand for a point inside the triangle such that $|AB| - |P B| \ge d$, and $|AC | - |P C | \ge d$. Is the following inequality true $|AM | - |P M | \ge d$, for any position of $M \in BC $?

Suppose $a,b,c,A,B,C$ are real numbers with $a\ne0$ and $A\ne0$ such that for all $x$, $$\left|ax^2+bx+c\right|\le\left|Ax^2+Bx+C\right|.$$Prove that $$\left|b^2-4ac\right|\le\left|B^2-4AC\right|.$$

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

Let $a_1,a_2,...,a_{1994}$ be real numbers in the interval $[-1,1]$, $$S=\frac{a_1+a_2+...+a_{1994}}{1994}.$$ Prove that for an arbitrary natural , $1\le n \le 1994$, holds the inequality $$| a_1+a_2+...+a_n - nS | \le 997.$$

On a semicircle with unit radius four consecutive chords $AB,BC, CD,DE$ with lengths $a, b, c, d$, respectively, are given. Prove that \[a^2 + b^2 + c^2 + d^2 + abc + bcd < 4.\]

Let $a$ and $b$ be natural numbers. We consider the set $M$ of the points of the plane with an integer $x$-coordinate from $1$ to $a$ and integer $y$-coordinate from $1$ to $b$. For two points $P = (x, y)$ and $Q = (\tilde x, \tilde y)$ in M we write $P\le Q$ if $x\le \tilde x$ and $y \le \tilde y$, we say $P$ is [i]less [/i] than $Q$ when $P\le Q$ and $P \ne Q$. A subset $S$ of $M$ is now called [i]cute [/i] if for every point $P \in S$ it also contains all smaller points. From an arbitrary subset $S$ of $M$ we can now create new subsets in four ways to construct: (a) the complement $K (S) = \overline{S}$, (b) the subset $\min (S)$ of its minima, i.e. those points for which there is no smaller in $S$ occurs, (c) the cute set $P (S)$ of all those points in M that are less than or equal to some point are from $S$, (d) you do all these things one after the other and get a set $Z (S) = P (\min (K (S)))$. Let $S$ be cute. Prove that $$\underset{a+b\,\, times\,\, Z}{Z(Z(...(Z(S))...))=S}$$