Let $S$ be the set of the positive integers greater than $1$, and let $n$ be from $S$. Does there exist a function $f$ from $S$ to itself such that for all pairwise distinct positive integers $a_1, a_2,...,a_n$ from $S$, we have $f(a_1)f(a_2)...f(a_n)=f(a_1^na_2^n...a_n^n)$?

Consider an arc of a planar curve; let the radius of curvature at any point of the arc be a differentiable function of the arc length and its derivative be everywhere different from zero; moreover, let the total curvature be less than $ \frac{\pi}{2}$. Let $ P_1,P_2,P_3,P_4,P_5$ and $ P_6$ be any points on this arc, subject to the only condition that the radius of curvature at $ P_k$ is greater than at $ P_j$ if $ j<k$. Prove that the radius of the circle passing through the points $ P_1,P_3$ and $ P_5$ is less than the radius of the circle through $ P_2,P_4$ and $ P_6$

Find all function $f:\mathbb{N}^*\rightarrow \mathbb{N}^*$ that satisfy: $(f(1))^3+(f(2))^3+...+(f(n))^3=(f(1)+f(2)+...+f(n))^2$

Let $g(x)$ be a polynomial of degree at least $2$ with all of its coefficients positive. Find all functions $f:\mathbb R^+ \longrightarrow \mathbb R^+$ such that \[f(f(x)+g(x)+2y)=f(x)+g(x)+2f(y) \quad \forall x,y\in \mathbb R^+.\] [i]Proposed by Mohammad Jafari[/i]

Is there an injective function $f : Z^+ \to Q$ satisfying the equation $f(xy) = f(x) + f(y)$ for all positive integers $x$ and $y$?

Consider a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admits bounded primitives. Prove that the function $ g:\mathbb{R}\longrightarrow\mathbb{R} $ defined as $$ f(x)=\left\{ \begin{matrix} x, & \quad x\le 0 \\ f(1/x)\cdot\ln x ,& \quad x>0 \end{matrix}\right. $$ admits primitives. [i]Florian Dumitrel[/i]

The expression $\dfrac{\dfrac{a}{a+y}+\dfrac{y}{a-y}}{\dfrac{y}{a+y}-\dfrac{a}{a-y}}$, a real, $a\neq 0$, has the value $-1$ for: $\textbf{(A)}\ \text{all but two real values of }y \qquad \textbf{(B)}\ \text{only two real values of }y \qquad$ $\textbf{(C)}\ \text{all real values of }y \qquad \textbf{(D)}\ \text{only one real value of }y \qquad \textbf{(E)}\ \text{no real values of }y$

Prove that for any positive integer $n$ and any real numbers $a_1,a_2,\cdots,a_n,b_1,b_2,\cdots,b_n$ we have that the equation \[a_1 \sin(x) + a_2 \sin(2x) +\cdots+a_n\sin(nx)=b_1 \cos(x)+b_2\cos(2x)+\cdots +b_n \cos(nx)\] has at least one real root.

How many functions $f : f\{1, 2, 3, 4, 5\}\longrightarrow\{1, 2, 3, 4, 5\}$ satisfy $f(f(x)) = f(x)$ for all $x\in\{ 1,2, 3, 4, 5\}$?

The [i]tower function of twos[/i] is defined recursively as follows: $ T(1) \equal{} 2$ and $ T(n \plus{} 1) \equal{} 2^{T(n)}$ for $ n\ge1$. Let $ A \equal{} (T(2009))^{T(2009)}$ and $ B \equal{} (T(2009))^A$. What is the largest integer $ k$ such that \[ \underbrace{\log_2\log_2\log_2\ldots\log_2B}_{k\text{ times}} \]is defined? $ \textbf{(A)}\ 2009\qquad \textbf{(B)}\ 2010\qquad \textbf{(C)}\ 2011\qquad \textbf{(D)}\ 2012\qquad \textbf{(E)}\ 2013$

On the number line, consider the point $x$ that corresponds to the value $10$. Consider $24$ distinct integer points $y_1$, $y_2$, $\ldots$, $y_{24}$ on the number line such that for all $k$ such that $1\leq k\leq 12$, we have that $y_{2k-1}$ is the reflection of $y_{2k}$ across $x$. Find the minimum possible value of \[\textstyle\sum_{n=1}^{24}(|y_n-1|+|y_n+1|).\]

Find all functions $u : R \to R$ for which there is a strictly increasing function $f : R \to R$ such that $f(x+y) = f(x)u(y)+ f(y)$ for all $x,y \in R$.

Let $A$ be the set of positive integers of the form $a^2 +2b^2$, where $a$ and $b$ are integers and $b \neq 0$. Show that if $p$ is a prime number and $p^2 \in A$, then $p \in A$.

$n$ is a natural number. for every positive real numbers $x_{1},x_{2},...,x_{n+1}$ such that $x_{1}x_{2}...x_{n+1}=1$ prove that: $\sqrt[x_{1}]{n}+...+\sqrt[x_{n+1}]{n} \geq n^{\sqrt[n]{x_{1}}}+...+n^{\sqrt[n]{x_{n+1}}}$

Determine all functions $ f$ mapping the set of positive integers to the set of non-negative integers satisfying the following conditions: (1) $ f(mn) \equal{} f(m)\plus{}f(n)$, (2) $ f(2008) \equal{} 0$, and (3) $ f(n) \equal{} 0$ for all $ n \equiv 39\pmod {2008}$.

A non-Hookian spring has force $F = -kx^2$ where $k$ is the spring constant and $x$ is the displacement from its unstretched position. For the system shown of a mass $m$ connected to an unstretched spring initially at rest, how far does the spring extend before the system momentarily comes to rest? Assume that all surfaces are frictionless and that the pulley is frictionless as well. [asy] size(250); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((0,0)--(0,-1)--(2,-1)--(2+sqrt(3),-2)); draw((2.5,-2)--(4.5,-2),dashed); draw(circle((2.2,-0.8),0.2)); draw((2.2,-0.8)--(1.8,-1.2)); draw((0,-0.6)--(0.6,-0.6)--(0.75,-0.4)--(0.9,-0.8)--(1.05,-0.4)--(1.2,-0.8)--(1.35,-0.4)--(1.5,-0.8)--(1.65,-0.4)--(1.8,-0.8)--(1.95,-0.6)--(2.2,-0.6)); draw((2+0.3*sqrt(3),-1.3)--(2+0.3*sqrt(3)+0.6/2,-1.3+sqrt(3)*0.6/2)--(2+0.3*sqrt(3)+0.6/2+0.2*sqrt(3),-1.3+sqrt(3)*0.6/2-0.2)--(2+0.3*sqrt(3)+0.2*sqrt(3),-1.3-0.2)); //super complex Asymptote code gg draw((2+0.3*sqrt(3)+0.3/2,-1.3+sqrt(3)*0.3/2)--(2.35,-0.6677)); draw(anglemark((2,-1),(2+sqrt(3),-2),(2.5,-2))); label("$30^\circ$",(3.5,-2),NW); [/asy] $ \textbf{(A)}\ \left(\frac{3mg}{2k}\right)^{1/2} $ $ \textbf{(B)}\ \left(\frac{mg}{k}\right)^{1/2} $ $ \textbf{(C)}\ \left(\frac{2mg}{k}\right)^{1/2} $ $ \textbf{(D)}\ \left(\frac{\sqrt{3}mg}{k}\right)^{1/3} $ $ \textbf{(E)}\ \left(\frac{3\sqrt{3}mg}{2k}\right)^{1/3} $

Given a function $f(x)=x^{2}+ax+b$ with $a,b \in R$, if there exists a real number $m$ such that $\left| f(m) \right| \leq \frac{1}{4}$ and $\left| f(m+1) \right| \leq \frac{1}{4}$, then find the maximum and minimum of the value of $\Delta=a^{2}-4b$.

Let $c\in \Big(0,\dfrac{\pi}{2}\Big) , a = \Big(\dfrac{1}{sin(c)}\Big)^{\dfrac{1}{cos^2 (c)}}, b = \Big(\dfrac{1}{cos(c)}\Big)^{\dfrac{1}{sin^2 (c)}}$. \\Prove that at least one of $a,b$ is bigger than $\sqrt[11]{2015}$.

Let $F(z)=\frac{z+i}{z-i}$ for all complex numbers $z\not= i,$ and let $z_n=F(z_{n-1})$ for all positive integers $n.$ Given that $z_0=\frac 1{137}+i$ and $z_{2002}=a+bi,$ where $a$ and $b$ are real numbers, find $a+b.$

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$. [i]Proposed by Mahyar Sefidgaran, Iran[/i]

Let $f$ be a real function with a continuous third derivative such that $f(x)$, $f^\prime(x)$, $f^{\prime\prime}(x)$, $f^{\prime\prime\prime}(x)$ are positive for all $x$. Suppose that $f^{\prime\prime\prime}(x)\leq f(x)$ for all $x$. Show that $f^\prime(x)<2f(x)$ for all $x$.

In each square of an $n\times{n}$ grid there is a lamp. If the lamp is touched it changes its state every lamp in the same row and every lamp in the same column (the one that are on are turned off and viceversa). At the begin, all the lamps are off. Show that lways is possible, with an appropriated sequence of touches, that all the the lamps on the board end on and find, in function of $n$ the minimal number of touches that are necessary to turn on every lamp.

Suppose a parabola with the axis as the $ y$ axis, concave up and touches the graph $ y\equal{}1\minus{}|x|$. Find the equation of the parabola such that the area of the region surrounded by the parabola and the $ x$ axis is maximal.

A round-robin tournament among $2n$ teams lasted for $2n-1$ days, as follows. On each day, every team played one game against another team, with one team winning and one team losing in each of the $n$ games. Over the course of the tournament, each team played every other team exactly once. Can one necessarily choose one winning team from each day without choosing any team more than once?

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.