Let $y = f (x)$ be a convex function defined on $[0,1]$, $f (0) = 0,$ $f (1) = 0$. It is also known that the area of ​​the segment bounded by this function and the segment $[0, 1]$ is equal to $1$. Find and draw the set of points of the coordinate plane through which the graph of such a function can pass. (A function is called convex if all points of the line segment connecting any two points on its graph are located no higher than the graph of this function.)

Let $0 < \alpha, \beta, \gamma < \frac{\pi}{2}$ and $\sin^{3} \alpha + \sin^{3} \beta + \sin^3 \gamma = 1$. Prove that \[ \tan^{2} \alpha + \tan^{2} \beta + \tan^{2} \gamma \geq \frac{3 \sqrt{3}}{2} . \]

A ship travels from point A to point B along a semicircular path, centered at Island X. Then it travels along a straight path from B to C. Which of these graphs best shows the ship's distance from Island X as it moves along its course? [asy]size(150); pair X=origin, A=(-5,0), B=(5,0), C=(0,5); draw(Arc(X, 5, 180, 360)^^B--C); dot(X); label("$X$", X, NE); label("$C$", C, N); label("$B$", B, E); label("$A$", A, W);[/asy] $\textbf{(A)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((4,10), 4, 0, 180)^^(8,10)--(16,12)); [/asy] $\textbf{(B)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((12,10), 4, 180, 360)^^(0,10)--(8,10)); [/asy] $\textbf{(C)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw((0,8)--(10,10)--(16,8)); [/asy] $\textbf{(D)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw(Arc((12,10), 4, 0, 180)^^(0,10)--(8,10)); [/asy] $\textbf{(E)}$ [asy] defaultpen(fontsize(7)); size(80); draw((0,16)--origin--(16,0), linewidth(0.9)); label("distance traveled", (8,0), S); label(rotate(90)*"distance to X", (0,8), W); draw((0,6)--(6,6)--(16,10)); [/asy]

Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.

Let $O$ be a point (in the plane) and $T$ be an infinite set of points such that $|P_1P_2| \le 2012$ for every two distinct points $P_1,P_2\in T$. Let $S(T)$ be the set of points $Q$ in the plane satisfying $|QP| \le 2013$ for at least one point $P\in T$. Now let $L$ be the set of lines containing exactly one point of $S(T)$. Call a line $\ell_0$ passing through $O$ [i]bad[/i] if there does not exist a line $\ell\in L$ parallel to (or coinciding with) $\ell_0$. (a) Prove that $L$ is nonempty. (b) Prove that one can assign a line $\ell(i)$ to each positive integer $i$ so that for every bad line $\ell_0$ passing through $O$, there exists a positive integer $n$ with $\ell(n) = \ell_0$. [i]Proposed by David Yang[/i]

What is the maximum number of points of intersection of the graphs of two different fourth degree polynomial functions $ y \equal{} p(x)$ and $ y \equal{} q(x)$, each with leading coefficient $ 1$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

Solve the equation $|x^2 -1|+ |x^2 - 4| = mx$ as a function of the parameter $m$. Which pairs $(x,m)$ of integers satisfy this equation?

On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.

Find all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy the condition \[f(f(x) + y) = 2x + f(f(y) - x)\quad \text{ for all } x, y \in\mathbb{R}.\]

Evaluate $ \int_0^1 \frac{x\minus{}e^{2x}}{x^2\minus{}e^{2x}}dx$.

Let $\mathcal M$ be the set of all polynomial functions $f$ of degree at most 3 such that \[\forall x\in[-1,1]:\ |f(x)|\le 1.\] Denote $a$ the (possibly zero) coefficient of $f$ at $x^3.$ Show that there is a positive number $k$ such that \[\forall f\in\mathcal M:\ |a|\le k\] and find the least $k$ with this property.

The positive reals $a,b,c,d$ satisfy $abcd=1$. Prove that $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{9}{{a + b + c + d}} \geqslant \frac{{25}}{4}$.

Let $\mathbb{N}^*=\{1,2,\ldots\}$. Find al the functions $f: \mathbb{N}^*\rightarrow \mathbb{N}^*$ such that: (1) If $x<y$ then $f(x)<f(y)$. (2) $f\left(yf(x)\right)=x^2f(xy)$ for all $x,y \in\mathbb{N}^*$.

Let $f, g:\mathbb{Z}\rightarrow [0,\infty )$ be two functions such that $f(n)=g(n)=0$ with the exception of finitely many integers $n$. Define $h:\mathbb{Z}\rightarrow [0,\infty )$ by \[h(n)=\max \{f(n-k)g(k): k\in\mathbb{Z}\}.\] Let $p$ and $q$ be two positive reals such that $1/p+1/q=1$. Prove that \[ \sum_{n\in\mathbb{Z}}h(n)\geq \Bigg(\sum_{n\in\mathbb{Z}}f(n)^p\Bigg)^{1/p}\Bigg(\sum_{n\in\mathbb{Z}}g(n)^q\Bigg)^{1/q}.\]

Function $f(x)$. which is defined on the set of non-negative real numbers, acquires real values. It is known that $f(0)\le 0$ and the function $f(x)/x$ is increasing for $x>0$. Prove that for arbitrary $x\ge 0$ and $y\ge 0$, holds the inequality $f(x+y)\ge f(x)+ f(y)$ .

An infinite table whose rows and columns are numbered with positive integers, is given. For a sequence of functions $f_1(x), f_2(x), \ldots $ let us place the number $f_i(j)$ into the cell $(i,j)$ of the table (for all $i, j\in \mathbb{N}$). A sequence $f_1(x), f_2(x), \ldots $ is said to be {\it nice}, if all the numbers in the table are positive integers, and each positive integer appears exactly once. Determine if there exists a nice sequence of functions $f_1(x), f_2(x), \ldots $, such that each $f_i(x)$ is a polynomial of degree 101 with integer coefficients and its leading coefficient equals to 1.

Let $S$ be the Sierpiński triangle. What can we say about the Hausdorff dimension of the elevation sets $f^{-1}(y)$ for typical continuous real functions defined on $S$? (A property is satisfied for typical continuous real functions on $S$ if the set of functions not having this property is of the first Baire category in the metric space of continuous $S\rightarrow\mathbb{R}$ functions with the supremum norm.) (translated by Miklós Maróti)

Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let \[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \] Prove that \[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \] where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?

Evaluate $ \int_{\minus{}\frac{1}{2}}^{\frac{1}{2}} \frac{x}{\{(2x\plus{}1)\sqrt{x^2\minus{}x\plus{}1}\plus{}(2x\minus{}1)\sqrt{x^2\plus{}x\plus{}1}\}\sqrt{x^4\plus{}x^2\plus{}1}}\ dx$.

Let \[f(x)=\dfrac{1}{1-\dfrac{1}{1-x}}\,.\] Compute $f^{2016}(2016)$, where $f$ is composed upon itself $2016$ times.

The sequence $ \{a_n\}$ satisfies $ a_0 \equal{} 0, a_{n \plus{} 1} \equal{} ka_n \plus{} \sqrt {(k^2 \minus{} 1)a_n^2 \plus{} 1}, n \equal{} 0, 1, 2, \ldots$, where $ k$ is a fixed positive integer. Prove that all the terms of the sequence are integral and that $ 2k$ divides $ a_{2n}, n \equal{} 0, 1, 2, \ldots$.

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?

For real $\theta_i$, $i = 1, 2, \dots, 2011$, where $\theta_1 = \theta_{2012}$, find the maximum value of the expression \[ \sum_{i=1}^{2011} \sin^{2012} \theta_i \cos^{2012} \theta_{i+1}. \] [i]Proposed by Lewis Chen [/i]

Let $n$ be a positive integer. What is the largest $k$ for which there exist $n\times n$ matrices $M_1,\dots,M_k$ and $N_1,\dots,N_k$ with real entries such that for all $i$ and $j,$ the matrix product $M_iN_j$ has a zero entry somewhere on its diagonal if and only if $i\ne j?$

Let $ R$ be an infinite ring such that every subring of $ R$ different from $ \{0 \}$ has a finite index in $ R$. (By the index of a subring, we mean the index of its additive group in the additive group of $ R$.) Prove that the additive group of $ R$ is cyclic. [i]L. Lovasz, J. Pelikan[/i]