Find all polynomials $ f\in\mathbb Z[x]$ such that for each $ a,b,x\in\mathbb N$ \[ a\plus{}b\plus{}c|f(a)\plus{}f(b)\plus{}f(c)\]

Let $\mathbb N$ denote the set of positive integers. A function $f\colon\mathbb N\to\mathbb N$ has the property that for all positive integers $m$ and $n$, exactly one of the $f(n)$ numbers \[f(m+1),f(m+2),\ldots,f(m+f(n))\] is divisible by $n$. Prove that $f(n)=n$ for infinitely many positive integers $n$.

A function $f:\mathbb{R} \to \mathbb{R}$ has the following property: $$\text{For every } x,y \in \mathbb{R} \text{ such that }(f(x)+y)(f(y)+x) > 0, \text{ we have } f(x)+y = f(y)+x.$$ Prove that $f(x)+y \leq f(y)+x$ whenever $x>y$.

The set of all real numbers $ x$ for which \[ \log_{2004}(\log_{2003}(\log_{2002}(\log_{2001}{x}))) \]is defined is $ \{x|x > c\}$. What is the value of $ c$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2001^{2002} \qquad \textbf{(C)}\ 2002^{2003} \qquad \textbf{(D)}\ 2003^{2004} \qquad \textbf{(E)}\ 2001^{2002^{2003}}$

Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that \[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0. \]

Let $\mathbb R$ be the real numbers. Set $S = \{1, -1\}$ and define a function $\operatorname{sign} : \mathbb R \to S$ by \[ \operatorname{sign} (x) = \begin{cases} 1 & \text{if } x \ge 0; \\ -1 & \text{if } x < 0. \end{cases} \] Fix an odd integer $n$. Determine whether one can find $n^2+n$ real numbers $a_{ij}, b_i \in S$ (here $1 \le i, j \le n$) with the following property: Suppose we take any choice of $x_1, x_2, \dots, x_n \in S$ and consider the values \begin{align*} y_i &= \operatorname{sign} \left( \sum_{j=1}^n a_{ij} x_j \right), \quad \forall 1 \le i \le n; \\ z &= \operatorname{sign} \left( \sum_{i=1}^n y_i b_i \right) \end{align*} Then $z=x_1 x_2 \dots x_n$.

A linear binomial $l(z) = Az + B$ with complex coefficients $A$ and $B$ is given. It is known that the maximal value of $|l(z)|$ on the segment $-1 \leq x \leq 1$ $(y = 0)$ of the real line in the complex plane $z = x + iy$ is equal to $M.$ Prove that for every $z$ \[|l(z)| \leq M \rho,\] where $\rho$ is the sum of distances from the point $P=z$ to the points $Q_1: z = 1$ and $Q_3: z = -1.$

The number $0$ or $1$ is to be assigned to each of the $n$ vertices of a regular polygon. In how many different ways can this be done (if we consider two assignments that can be obtained one from the other through rotation in the plane of the polygon to be identical)?

Find the positive integers $n$ with $n \geq 4$ such that $[\sqrt{n}]+1$ divides $n-1$ and $[\sqrt{n}]-1$ divides $n+1$. [hide="Remark"]This problem can be solved in a similar way with the one given at [url=http://www.mathlinks.ro/Forum/resources.php?c=1&cid=97&year=2006]Cono Sur Olympiad 2006[/url], problem 5.[/hide]

Let $f : \mathbb{Z} \to \mathbb{Z}$ be a function satisfying $f(0) \ne 0$, $f(1) = 0$ and $(i) f(xy) + f(x)f(y) = f(x) + f(y)$ $(ii)\left(f(x-y) - f(0)\right ) f(x)f(y) = 0 $ for all $x,y \in \mathbb{Z}$, simultaneously. $(a)$ Find the set of all possible values of the function $f$. $(b)$ If $f(10) \ne 0$ and $f(2) = 0$, find the set of all integers $n$ such that $f(n) \ne 0$.

Let $ a$, $ b$, $ c$ be three real numbers. For each positive integer number $ n$, $ a^n \plus{} b^n \plus{} c^n$ is an integer number. Prove that there exist three integers $ p$, $ q$, $ r$ such that $ a$, $ b$, $ c$ are the roots of the equation $ x^3 \plus{} px^2 \plus{} qx \plus{} r \equal{} 0$.

[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$? [i]Alexandar Ivanov[/i]

For any continuous real-valued function $f$ defined on the interval $[0,1],$ let \[\mu(f)=\int_0^1f(x)\,dx,\text{Var}(f)=\int_0^1(f(x)-\mu(f))^2\,dx, M(f)=\max_{0\le x\le 1}|f(x)|.\] Show that if $f$ and $g$ are continuous real-valued functions defined on the interval $[0,1],$ then \[\text{Var}(fg)\le 2\text{Var}(f)M(g)^2+2\text{Var}(g)M(f)^2.\]

Quadratic function $f(x)=ax^2+bx+c$ satisfies that: $(1)\forall x\in\mathbb{R},f(x-4)=f(2-x),f(x)\geq x$; $(2)\forall x\in(0,2),f(x)\leq\left(\frac{x+1}{2}\right)^2$; $(3)\min\limits_{x\in\mathbb{R}}f(x)=0$ Find the maximum of $m(m>1)$, satisfying: There exists $t\in\mathbb{R}$, as long as $x\in[1,m]$, then $f(x+t)\leq x$.

The differentiable function $F:\mathbb{R}\to\mathbb{R}$ satisfies $F(0)=-1$ and \[\dfrac{d}{dx}F(x)=\sin (\sin (\sin (\sin(x))))\cdot \cos( \sin (\sin (x))) \cdot \cos (\sin(x))\cdot\cos(x).\] Find $F(x)$ as a function of $x$.

Can the graphs of a polynomial of degree 20 and the function $\displaystyle y={1\over x^{40}}$ have exactly 30 points of intersection? [i]Proposed by K. Kokhas[/i]

Every square on a $n\times n$ chessboard is colored with red, blue, or green. Each red square has at least one green square adjacent to it, each green square has at least one blue square adjacent to it, and each blue square has at least one red square adjacent to it. Let $R$ be the number of red squares. Prove that $\displaystyle \frac{n^2}{11} \le R \le \frac{2n^2}{3}$.

Maria was a brilliant mathematician who found the following property about her year of birth: if $f$ is a function defined in the set of natural numbers $N = \{0, 1, 2, 3, 4, 5,...\}$ such that $f(1) = 1335$ and $f(n+1) = f(n)-2n+43$ for all $n \in N$, then his year of birth is the maximum value that $f(n)$ can reach when $n$ takes values in $N$. Determine the year of birth of Mary.

For a natural number $n$, with $v_2(n)$ we denote the largest integer $k\geq0$ such that $2^k|n$. Let us assume that the function $f\colon\mathbb{N}\to\mathbb{N}$ meets the conditions: $(i)$ $f(x)\leq3x$ for all natural numbers $x\in\mathbb{N}$. $(ii)$ $v_2(f(x)+f(y))=v_2(x+y)$ for all natural numbers $x,y\in\mathbb{N}$. Prove that for every natural number $a$ there exists exactly one natural number $x$ such that $f(x)=3a$.

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for any two positive integers $m,n$ we have : $$f(n)+1400m^2|n^2+f(f(m))$$

For a function $f(x)\ (x\geq 1)$ satisfying $f(x)=(\log_e x)^2-\int_1^e \frac{f(t)}{t}dt$, answer the questions as below. (a) Find $f(x)$ and the $y$-coordinate of the inflection point of the curve $y=f(x)$. (b) Find the area of the figure bounded by the tangent line of $y=f(x)$ at the point $(e,\ f(e))$, the curve $y=f(x)$ and the line $x=1$.

The two polynomials $(x) =x^4+ax^3+bx^2+cx+d$ and $Q(x) = x^2+px+q$ take negative values on an interval $I$ of length greater than $2$, and nonnegative values outside of $I$. Prove that there exists $x_0 \in \mathbb R$ such that $P(x_0) < Q(x_0)$.

Let f be a function that satisfies the following conditions: $(i)$ If $x > y$ and $f(y) - y \geq v \geq f(x) - x$, then $f(z) = v + z$, for some number $z$ between $x$ and $y$. $(ii)$ The equation $f(x) = 0$ has at least one solution, and among the solutions of this equation, there is one that is not smaller than all the other solutions; $(iii)$ $f(0) = 1$. $(iv)$ $f(1987) \leq 1988$. $(v)$ $f(x)f(y) = f(xf(y) + yf(x) - xy)$. Find $f(1987)$. [i]Proposed by Australia.[/i]

Prove that \[\sum_{cyc}(x+y)\sqrt{(z+x)(z+y)} \geq 4(xy+yz+zx),\] for all positive real numbers $x,y$ and $z$.

Find all real numbers $x$ such that $x\lfloor x\lfloor x\lfloor x\rfloor\rfloor\rfloor=88$. The notation $\lfloor x\rfloor$ means the greatest integer less than or equal to $x$.