Let $\mathbb{Z}_+=\{1,2,3,4...\}$ be the set of all positive integers. Find, with proof, all functions $f : \mathbb{Z}_+ \mapsto \mathbb{Z}_+$ with the property that $$f(x+f(y)+f(f(z)))=z+f(y)+f(f(x))$$ for all positive integers $x,y,z$.

Let be a nondegenerate and closed interval $ I $ of real numbers, a short map $ m:I\longrightarrow I, $ and a sequence of functions $ \left( x_n \right)_{n\ge 1} :I\longrightarrow\mathbb{R} $ such that $ x_1 $ is the identity map and $$ 2x_{n+1}=x_n+m\circ x_n , $$ for any natural numbers $ n. $ Prove that: [b]a)[/b] there exists a nondegenerate interval having the property that any point of it is a fixed point for $ m. $ [b]b)[/b] $ \left( x_n \right)_{n\ge 1} $ is pointwise convergent and that its limit function is a short map.

Let be a continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that there exists a continuous and bounded function $ g:\mathbb{R}\longrightarrow\mathbb{R} $ that verifies the equality $$ f(x)=\int_0^x f(\xi )g(\xi )d\xi , $$ for any real number $ x. $ Prove that $ f=0. $ [i]Nelu Chichirim[/i]

A polynomial $p(x)$ of degree $n\ge 2$ has exactly $n$ real roots, counted with multiplicity. We know that the coefficient of $x^n$ is $1$, all the roots are less than or equal to $1$, and $p(2)=3^n$. What values can $p(1)$ take?

Let $ n$ be a positive integer, and let $ x$ and $ y$ be a positive real number such that $ x^n \plus{} y^n \equal{} 1.$ Prove that \[ \left(\sum^n_{k \equal{} 1} \frac {1 \plus{} x^{2k}}{1 \plus{} x^{4k}} \right) \cdot \left( \sum^n_{k \equal{} 1} \frac {1 \plus{} y^{2k}}{1 \plus{} y^{4k}} \right) < \frac {1}{(1 \minus{} x) \cdot (1 \minus{} y)}. \] [i]Author: Juhan Aru, Estonia[/i]

$ k$ is a given natural number. Find all functions $ f: \mathbb{N}\rightarrow\mathbb{N}$ such that for each $ m,n\in\mathbb{N}$ the following holds: \[ f(m)\plus{}f(n)\mid (m\plus{}n)^k\]

For $ x\geq 0,$ define a function $ f(x)\equal{}\sin \left(\frac{n\pi}{4}\right)\sin x\ (n\pi \leq x<(n\plus{}1)\pi )\ (n\equal{}0,\ 1,\ 2,\ \cdots)$. Evaluate $ \int_0^{100\pi } f(x)\ dx.$

Consider a positive integer $a > 1$. If $a$ is not a perfect square then at the next move we add $3$ to it and if it is a perfect square we take the square root of it. Define the trajectory of a number $a$ as the set obtained by performing this operation on $a$. For example the cardinality of $3$ is $\{3, 6, 9\}$. Find all $n$ such that the cardinality of $n$ is finite. The following part problems may attract partial credit. $\textbf{(a)}$Show that the cardinality of the trajectory of a number cannot be $1$ or $2$. $\textbf{(b)}$Show that $\{3, 6, 9\}$ is the only trajectory with cardinality $3$. $\textbf{(c)}$ Show that there for all $k \geq 3$, there exists a number such that the cardinality of its trajectory is $k$. $\textbf{(d)}$ Give an example of a number with cardinality of trajectory as infinity.

Find the number of real solutions of the equation $a e^x = x^3$, where $a$ is a real parameter.

Suppose that $f : \mathbb{N} \rightarrow \mathbb{N}$ is a function for which the expression $af(a)+bf(b)+2ab$ for all $a,b \in \mathbb{N}$ is always a perfect square. Prove that $f(a)=a$ for all $a \in \mathbb{N}$.

Let $f: \mathbb{R}\to\mathbb{R}$ is a function such that $f( \cot x ) = \cos 2x+\sin 2x$ for all $0 < x < \pi$. Define $g(x) = f(x) f(1-x)$ for $-1 \leq x \leq 1$. Find the maximum and minimum values of $g$ on the closed interval $[-1, 1].$

Let $R$ be a square region and $n\ge4$ an integer. A point $X$ in the interior of $R$ is called $n\text{-}ray$ partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are 100-ray partitional but not 60-ray partitional? $\textbf{(A)}\,1500 \qquad\textbf{(B)}\,1560 \qquad\textbf{(C)}\,2320 \qquad\textbf{(D)}\,2480 \qquad\textbf{(E)}\,2500$

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

Let $f(x,y)$ and $g(x,y)$ be real valued functions defined for every $x,y \in \{1,2,..,2000\}$. If there exist $X,Y \subset \{1,2,..,2000\}$ such that $s(X)=s(Y)=1000$ and $x\notin X$ and $y\notin Y$ implies that $f(x,y)=g(x,y)$ than, what is the maximum number of $(x,y)$ couples where $f(x,y)\neq g(x,y)$.

There are three boxes of stones. Sisyphus moves stones one by one between the boxes. Whenever he moves a stone, Zeus gives him the number of coins that is equal to the difference between the number of stones in the box the stone was put in, and that in the box the stone was taken from (the moved stone does not count). If this difference is negative, then Sisyphus returns the corresponding amount to Zeus (if Sisyphus cannot pay, generous Zeus allows him to make the move and pay later). After some time all the stones lie in their initial boxes. What is the greatest possible earning of Sisyphus at that moment? [i]I. Izmest’ev[/i]

Let $n$ be a positive integer. Prove that \[ \binom{n}{0}^{-1} + \binom{n}{1}^{-1} + \cdots + \binom{n}{n}^{-1} = \frac{n+1}{2^{n+1}} \left( \frac{2}{1} + \frac{2^2}{2} + \cdots + \frac{2^{n+1}}{n+1} \right). \]

Four siblings are sitting down to eat some mashed potatoes for lunch: Ethan has 1 ounce of mashed potatoes, Macey has 2 ounces, Liana has 4 ounces, and Samuel has 8 ounces. This is not fair. A blend consists of choosing any two children at random, combining their plates of mashed potatoes, and then giving each of those two children half of the combination. After the children's father performs four blends consecutively, what is the probability that the four children will all have the same amount of mashed potatoes?

Let the function $f:N^*\to N^*$ such that [b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$; [b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$ Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$. (High School Affiliated to Nanjing Normal University )

If $a,b,c$ are three real numbers and \[ a + \dfrac{1}{b} = b + \dfrac{1}{c} = c + \dfrac{1}{a} = t \] for some real number $t$, prove that $abc + t = 0 .$

Let$f:\mathbb{R}\to \mathbb{R}$be a monotone function. a) Prove that$f$ have side limits in each point ${{x}_{0}}\in \mathbb{R}$. b) We define the function $g:\mathbb{R}\to \mathbb{R}$, $g\left( x \right)=\underset{t\nearrow x}{\mathop{\lim }}\,f\left( t \right)$( $g\left( x \right)$ with limit at at left in $x$). Prove that if the $g$ function is continuous, than the function $f$ is continuous.

For an arbitrary real number $ x$, $ \lfloor x\rfloor$ denotes the greatest integer not exceeding $ x$. Prove that there is exactly one integer $ m$ which satisfy $ \displaystyle m\minus{}\left\lfloor \frac{m}{2005}\right\rfloor\equal{}2005$.

Let $f: \mathbb{R}\rightarrow ]0,+\infty[$ be an increasing differentiable function with $\lim_{x\rightarrow+\infty}f(x)=+\infty$ and $f'$ is bounded, and let $F(x)=\int^x_0 f(t) dt$. Define the sequence $(a_n)$ recursively by $a_0=1,a_{n+1}=a_n+\frac1{f(a_n)}$ Define the sequence $(b_n)$ by $b_n=F^{-1}(n)$. Prove that $\lim_{x\rightarrow+\infty}(a_n-b_n)=0$.

Let $(a_n)_{n=1}^{\infty}$ be a sequence with $a_n \in \{0,1\}$ for every $n$. Let $F:(-1,1) \to \mathbb{R}$ be defined by \[F(x)=\sum_{n=1}^{\infty} a_nx^n\] and assume that $F\left(\frac{1}{2}\right)$ is rational. Show that $F$ is the quotient of two polynomials with integer coefficients.

Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.

Let $p$ be a prime. We say that a sequence of integers $\{z_n\}_{n=0}^\infty$ is a [i]$p$-pod[/i] if for each $e \geq 0$, there is an $N \geq 0$ such that whenever $m \geq N$, $p^e$ divides the sum \[\sum_{k=0}^m (-1)^k {m \choose k} z_k.\] Prove that if both sequences $\{x_n\}_{n=0}^\infty$ and $\{y_n\}_{n=0}^\infty$ are $p$-pods, then the sequence $\{x_ny_n\}_{n=0}^\infty$ is a $p$-pod.