The function $f_n (x)\ (n=1,2,\cdots)$ is defined as follows. \[f_1 (x)=x,\ f_{n+1}(x)=2x^{n+1}-x^n+\frac{1}{2}\int_0^1 f_n(t)\ dt\ \ (n=1,2,\cdots)\] Evaluate \[\lim_{n\to\infty} f_n \left(1+\frac{1}{2n}\right)\]

For each integer $n\ge2$ prove the inequality $$\log_23+\log_34+\ldots+\log_n(n+1)<n+\ln n-0.9.$$

A drawer contains a mixture of red socks and blue socks, at most 1991 in all. It so happens that, when two socks are selected randomly without replacement, there is a probability of exactly $1/2$ that both are red or both are blue. What is the largest possible number of red socks in the drawer that is consistent with this data?

Prove that the non-negative numbers $ a_1, a_2, \ldots, a_n $ ($ n = 1, 2, \ldots $) satisfy the inequality $ x_1, x_2, \ldots, x_n $ for any real numbers $$ \left( \sum_{i=1}^n a_i x_i^2 \right)^2 \leq \sum_{i=1}^n a_i x_i^4.$$ it is necessary and sufficient that $ \sum_{i=1}^n a_i \leq 1 $.

Let $a,b,c$ be positive reals satisfying $a^3+b^3+c^3+abc=4$. Prove that \[ \frac{(5a^2+bc)^2}{(a+b)(a+c)} + \frac{(5b^2+ca)^2}{(b+c)(b+a)} + \frac{(5c^2+ab)^2}{(c+a)(c+b)} \ge \frac{(a^3+b^3+c^3+6)^2}{a+b+c} \] and determine the cases of equality. [i]Proposed by Evan Chen[/i]

$ ABCD$ is a $ 4\times 4$ square. $ E$ is the midpoint of $ \left[AB\right]$. $ M$ is an arbitrary point on $ \left[AC\right]$. How many different points $ M$ are there such that $ \left|EM\right|\plus{}\left|MB\right|$ is an integer? $\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$

Let $ ABCD$ be a cyclic quadrilateral. The side lengths of $ ABCD$ are distinct integers less than $ 15$ such that $ BC\cdot CD\equal{}AB\cdot DA$. What is the largest possible value of $ BD$? $ \textbf{(A)}\ \sqrt{\frac{325}{2}} \qquad \textbf{(B)}\ \sqrt{185} \qquad \textbf{(C)}\ \sqrt{\frac{389}{2}} \qquad \textbf{(D)}\ \sqrt{\frac{425}{2}} \qquad \textbf{(E)}\ \sqrt{\frac{533}{2}}$

Let $n$ and $k$ be positive integers, where $n > 1$ is odd. Suppose $n$ voters are to elect one of the $k$ cadidates from a set $A$ according to the rule of "majoritarian compromise" described below. After each voter ranks the candidates in a column according to his/her preferences, these columns are concatenated to form a $k$ x $n$ voting matrix. We denote the number of ccurences of $a \in A$ in the $i$-th row of the voting matrix by $a_{i}$ . Let $l_{a}$ stand for the minimum integer $l$ for which $\sum^{l}_{i=1}{a_{i}}> \frac{n}{2}$. Setting $l'= min \{l_{a} | a \in A\}$, we will regard the voting matrices which make the set $\{a \in A | l_{a} = l' \}$ as admissible. For each such matrix, the single candidate in this set will get elected according to majoritarian compromise. Moreover, if $w_{1} \geq w_{2} \geq ... \geq
w_{k} \geq 0$ are given, for each admissible voting matrix, $\sum^{k}_{i=1}{w_{i}a_{i}}$ is called the total weighted score of $a \in A$. We will say that the system $(w_{1},w_{2}, . . . , w_{k})$ of weights represents majoritarian compromise if the total score of the elected candidate is maximum among the scores of all candidates. (a) Determine whether there is a system of weights representing majoritarian compromise if $k = 3$. (b) Show that such a system of weights does not exist for $k > 3$.

Let $r$ and $s$ be positive real numbers such that $(r+s-rs)(r+s+rs)=rs$. Find the minimum value of $r+s-rs$ and $r+s+rs$

In the triangle $ABC$ it is known that $BC = 5, AC - AB = 3$. Prove that $r <2 <r_a$ . (here $r$ is the radius of the circle inscribed in the triangle $ABC$, $r_a$ is the radius of an exscribed circle that touches the sides of $BC$). (Mykola Moroz)

Let $x_1$, $x_2$,$x_3$, $y_1$, $y_2$, and $y_3 $ be positive real numbers, such that $x_1 + y_2 = x_2 + y_3 = x_3 + y_1 =1$. Prove that $$ x_1y_1 + x_2y_2 + x_3y_3 <1$$

Four real numbers $ p$, $ q$, $ r$, $ s$ satisfy $ p+q+r+s = 9$ and $ p^{2}+q^{2}+r^{2}+s^{2}= 21$. Prove that there exists a permutation $ \left(a,b,c,d\right)$ of $ \left(p,q,r,s\right)$ such that $ ab-cd \geq 2$.

Find all positive integers $n,k_1,\dots,k_n$ such that $k_1+\cdots+k_n=5n-4$ and \[ \frac1{k_1}+\cdots+\frac1{k_n}=1. \]

Each side of $1 \times 1$ square is a hypothenuse of an exterior right triangle. Let $A, B, C, D$ be the vertices of the right angles and $O_1, O_2, O_3, O_4$ be the centers of the incircles of these triangles. Prove that $a)$ The area of quadrilateral $ABCD$ does not exceed $2$; $b)$ The area of quadrilateral $O_1O_2O_3O_4$ does not exceed $1$.

If $a,b,c$ are positive real numbers such that $abc= 1$, Prove that \[ a^{b+c} b^{c+a} c^{a+b} \leq 1 . \]

Let the real numbers $x, y, z$ be such that $x + y + z = 0$. Prove that $$6(x^3 + y^3 + z^3)^2 \le (x^2 + y^2 + z^2)^3.$$

Let $q$ and $r$ be integers with $q>0,$ and let $A$ and $B$ be intervals on the real line. Let $T$ be the set of all $b+mq$ where $b$ and $m$ are integers with $b$ in $B,$ and let $S$ be the set of all integers $a$ in $A$ such that $ra$ is in $T.$ Show that if the product of the lengths of $A$ and $B$ is less than $q,$ then $S$ is the intersection of $A$ with some arithmetic progression.

Let $a_1,...,a_n$ be positive real numbers such that $\sum_{i=1}^n a_i =\prod_{i=1}^n a_i $ , and let $b_1,...,b_n$ be positive real numbers such that $a_i \le b_i$ for all $i$. Prove that $\sum_{i=1}^n b_i \le\prod_{i=1}^n b_i $

Prove that for all positive integers $a, b, c$ the following inequality holds: $$\frac{a + b}{a + c}+\frac{b + c}{b + a}+\frac{c + a}{c + b} \le \frac{a}{b}+\frac{b}{c}+\frac{c}{a}$$

For any positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq 2m\sqrt{n}$$ As usual, [x,y] denotes the least common multiply of $x,y$ [I]Proposed by A. Golovanov[/i]

We consider the real numbers $a _ 1, a _ 2, a _ 3, a _ 4, a _ 5$ with the zero sum and the property that $| a _ i - a _ j | \le 1$ , whatever it may be $i,j \in \{1, 2, 3, 4, 5 \} $. Show that $a _ 1 ^ 2 + a _ 2 ^ 2 + a _ 3 ^ 2 + a _ 4 ^ 2 + a _ 5 ^ 2 \le \frac {6} {5}$ .

Let $\mathbb{R}^{+}$ denote the set of all positive real numbers. Find all functions $f:\mathbb{R}^{+}\longrightarrow \mathbb{R}$ satisfying \[f(x)+f(y)\le \frac{f(x+y)}{2}, \frac{f(x)}{x}+\frac{f(y)}{y}\ge \frac{f(x+y)}{x+y},\] for all $x, y\in \mathbb{R}^{+}$.

For a positive reals $ x_{1},...,x_{n} $ prove inequlity: $ \frac{1}{x_{1}+1}+...+\frac{1}{x_{n}+1}\le \frac{n}{1+\frac{n}{\frac{1}{x_{1}}+...+\frac{1}{x_{n}}}}$

Let $a, b, c$ be positive reals, and let $\sqrt[2013]{\frac{3}{a^{2013}+b^{2013}+c^{2013}}}=P$. Prove that \[\prod_{\text{cyc}}\left(\frac{(2P+\frac{1}{2a+b})(2P+\frac{1}{a+2b})}{(2P+\frac{1}{a+b+c})^2}\right)\ge \prod_{\text{cyc}}\left(\frac{(P+\frac{1}{4a+b+c})(P+\frac{1}{3b+3c})}{(P+\frac{1}{3a+2b+c})(P+\frac{1}{3a+b+2c})}\right).\][i]Proposed by David Stoner[/i]

A convex quadrilateral is inscribed in a circle of radius $1$. Prove that the difference between its perimeter and the sum of the lengths of its diagonals is greater than zero and less than $2.$