Determine functions $f : \mathbb{R} \rightarrow \mathbb{R},$ with property that \[ f(f(x)) + y \cdot f(x) \le x + x \cdot f(f(y)), \] for every $x$ and $y$ are real numbers.

Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation \[ f(f(f(n))) = f(n+1 ) +1 \] for all $ n\in \mathbb{Z}_{\ge 0}$.

There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?

Suppose two functions $ f(x)\equal{}x^4\minus{}x,\ g(x)\equal{}ax^3\plus{}bx^2\plus{}cx\plus{}d$ satisfy $ f(1)\equal{}g(1),\ f(\minus{}1)\equal{}g(\minus{}1)$. Find the values of $ a,\ b,\ c,\ d$ such that $ \int_{\minus{}1}^1 (f(x)\minus{}g(x))^2dx$ is minimal.

For a given positive integer $n$ determine the maximum value of the function $f (x) = \frac{x + x^2 +...+ x^{2n-1}}{(1 + x^n)^2}$ over all $x \ge 0$ and find all positive $x$ for which the maximum is attained.

Let $\displaystyle a,b,c,d \in \mathbb R$ such that $\displaystyle a>c>d>b>1$ and $\displaystyle ab>cd$. Prove that $\displaystyle f : \left[ 0,\infty \right) \to \mathbb R$, defined through \[ \displaystyle f(x) = a^x+b^x-c^x-d^x, \, \forall x \geq 0 , \] is strictly increasing.

Let $f\left(x\right)=x^2-14x+52$ and $g\left(x\right)=ax+b$, where $a$ and $b$ are positive. Find $a$, given that $f\left(g\left(-5\right)\right)=3$ and $f\left(g\left(0\right)\right)=103$. $\text{(A) }2\qquad\text{(B) }5\qquad\text{(C) }7\qquad\text{(D) }10\qquad\text{(E) }17$

Let $A$ be a set of functions $f : R\to R$. For all $f_1, f_2 \in A$ there exists a $f_3 \in A$ such that $f_1(f_2(y) - x)+ 2x = f_3(x + y)$ for all $x, y \in R$. Prove that for all $f \in A$, we have $f(x - f(x))= 0$ for all $x \in R$.

Let ABC be a triangle and let $r, r_a, r_b, r_c$ denote the inradius and ex-radii opposite to the vertices $A, B, C$, respectively. Suppose that $a>r_a, b>r_b, c>r_c$. Prove that [b](a)[/b] $\triangle ABC$ is acute. [b](b)[/b] $a+b+c > r+r_a+r_b+r_c$.

[b]2.[/b] Let $f_{1}(x), \dots , f_{n}(x)$ be Lebesgue integrable functions on $[0,1]$, with $\int_{0}^{1}f_{1}(x) dx= 0$ $ (i=1,\dots ,n)$. Show that, for every $\alpha \in (0,1)$, there existis a subset $E$ of $[0,1]$ with measure $\alpha$, such that $\int_{E}f_{i}(x)dx=0$. [b](R. 17)[/b]

A smooth function $f:I\to \mathbb{R}$ is said to be [i]totally convex[/i] if $(-1)^k f^{(k)}(t) > 0$ for all $t\in I$ and every integer $k>0$ (here $I$ is an open interval). Prove that every totally convex function $f:(0,+\infty)\to \mathbb{R}$ is real analytic. [b]Note[/b]: A function $f:I\to \mathbb{R}$ is said to be [i]smooth[/i] if for every positive integer $k$ the derivative of order $k$ of $f$ is well defined and continuous over $\mathbb{R}$. A smooth function $f:I\to \mathbb{R}$ is said to be [i]real analytic[/i] if for every $t\in I$ there exists $\epsilon> 0$ such that for all real numbers $h$ with $|h|<\epsilon$ the Taylor series \[\sum_{k\geq 0}\frac{f^{(k)}(t)}{k!}h^k\] converges and is equal to $f(t+h)$.

Let $\mathbb N_0$ be the set of non-negative integers. There is a triple $(f,a,b)$, where $f$ is a function from $\mathbb N_0$ to $\mathbb N_0$ and $a,b\in\mathbb N_0$ that satisfies the following conditions: [list] [*]$f(1)=2$ [*]$f(a)+f(b)\leq 2\sqrt{f(a)}$ [*]For all $n>0$, we have $f(n)=f(n-1)f(b)+2n-f(b)$ [/list] Find the sum of all possible values of $f(b+100)$.

Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find \[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]

Let $n \geq 0$ be an integer. Prove that \[ \lceil \sqrt n +\sqrt{n+1}+\sqrt{n+2} \rceil = \lceil \sqrt{9n+8} \rceil\] Where $\lceil x \rceil $ is the smallest integer which is greater or equal to $x.$

Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

Let $ \Gamma(I,r)$ and $ \Gamma(O,R)$ denote the incircle and circumcircle, respectively, of a triangle $ ABC$. Consider all the triangels $ A_iB_iC_i$ which are simultaneously inscribed in $ \Gamma(O,R)$ and circumscribed to $ \Gamma(I,r)$. Prove that the centroids of these triangles are concyclic.

Find a function $f(x)$ defined for all real values of $x$ such that for all $x$, \[f(x+ 2) - f(x) = x^2 + 2x + 4,\] and if $x \in [0, 2)$, then $f(x) = x^2.$

Find all surjective functions $f\colon (0,+\infty) \to (0,+\infty)$ such that $2x f(f(x)) = f(x)(x+f(f(x)))$ for all $x>0$.

Let $ f:[0,1]\longrightarrow\mathbb{R} $ be a countinuous function such that $$ \int_0^1 f(x)dx=\int_0^1 xf(x)dx. $$ Show that there is a $ c\in (0,1) $ such that $ f(c)=\int_0^c f(x)dx. $

Find all functions $f:\mathbb{R} \to \mathbb{R}$ such that \[yf(x+1)=f(x+y-f(x))+f(x)f(f(y))\] for all $x,y \in \mathbb{R}$.

There is a sequence with $a(2)=0$, $a(3)=1$ and $a(n)=a\left(\left\lfloor\dfrac n2\right\rfloor\right)+a\left(\left\lceil\dfrac n2\right\rceil\right)$ for $n\geq 4$. Find $a(2014)$. [Note that $\left\lfloor\dfrac n2\right\rfloor$ and $\left\lceil\dfrac n2\right\rceil$ denote the floor function (largest integer $\leq\tfrac n2$) and the ceiling function (smallest integer $\geq\tfrac n2$), respectively.]

Consider a convex polyhedron $P$ with vertices $V_1,\ldots ,V_p$. The distinct vertices $V_i$ and $V_j$ are called [i]neighbours[/i] if they belong to the same face of the polyhedron. To each vertex $V_k$ we assign a number $v_k(0)$, and construct inductively the sequence $v_k(n)\ (n\ge 0)$ as follows: $v_k(n+1)$ is the average of the $v_j(n)$ for all neighbours $V_j$ of $V_k$ . If all numbers $v_k(n)$ are integers, prove that there exists the positive integer $N$ such that all $v_k(n)$ are equal for $n\ge N$ .

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all real numbers $a$ for which there exists a function $f :\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $3(f(x))^{2}=2f(f(x))+ax^{4}$, for all $x \in \mathbb{R}^{+}$.

The function $f$ is defined on the set $\mathbb{Q}$ of all rational numbers and has values in $\mathbb{Q}$. It satisfies the conditions $f(1) = 2$ and $f(xy) = f(x)f(y) - f(x+y) + 1$ for all $x,y \in \mathbb{Q}$. Determine $f$.

Let $f(x)$ be a real-valued function, defined for $-1<x<1$ for which $f'(0)$ exists. Let $(a_n) , (b_n)$ be two sequences such that $-1 <a_n <0 <b_n <1$ for all $n$ and $\lim_{n \to \infty } a_n = 0 =\lim_{n \to \infty} b_n.$ Prove that $$ \lim_{n \to \infty} \frac{ f(b_n )- f(a_n ) }{b_n -a_n} =f'(0).$$