Find all continuous functions $f:[1,8]\to\mathbb R$, such that $$\int^2_1f(t^3)^2dt+2\int^2_1f(t^3)dt=\frac23\int^8_1f(t)dt-\int^2_1(t^2-1)^2dt.$$

For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always: \[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]

In the Cartesian plane, let $G_1$ and $G_2$ be the graphs of the quadratic functions $f_1(x) = p_1x^2 + q_1x + r_1$ and $f_2(x) = p_2x^2 + q_2x + r_2$, where $p_1 > 0 > p_2$. The graphs $G_1$ and $G_2$ cross at distinct points $A$ and $B$. The four tangents to $G_1$ and $G_2$ at $A$ and $B$ form a convex quadrilateral which has an inscribed circle. Prove that the graphs $G_1$ and $G_2$ have the same axis of symmetry.

Find the number of ways a series of $+$ and $-$ signs can be inserted between the numbers $0,1,2,\cdots, 12$ such that the value of the resulting expression is divisible by 5. [i]Proposed by Matthew Lerner-Brecher[/i]

Find all continuous functions $f(x)$ defined for all $x>0$ such that for every $x$, $y > 0$ \[ f\left(x+{1\over x}\right)+f\left(y+{1\over y}\right)= f\left(x+{1\over y}\right)+f\left(y+{1\over x}\right) . \] [i]Proposed by F. Petrov[/i]

It is given the function $f:\left( \mathbb{R} - \{0\} \right) \times \left( \mathbb{R}-\{0\} \right) \to \mathbb{R}$ such that $f(a,b)= \left| \frac{|b-a|}{|ab|}+\frac{b+a}{ab}-1 \right|+ \frac{|b-a|}{|ab|}+ \frac{b+a}{ab}+1$ where $a,b \not=0$. Prove that: \[ f(a,b)=4 \cdot \text{max} \left\{\frac{1}{a},\frac{1}{b},\frac{1}{2} \right\}\]

Let $f(k)$ be the number of integers $n$ satisfying the following conditions: (i) $0\leq n < 10^k$ so $n$ has exactly $k$ digits (in decimal notation), with leading zeroes allowed; (ii) the digits of $n$ can be permuted in such a way that they yield an integer divisible by $11$. Prove that $f(2m) = 10f(2m-1)$ for every positive integer $m$. [i]Proposed by Dirk Laurie, South Africa[/i]

For $0<k<2$, consider two curves $C_1: y=\sin 2x\ (0\leq x\leq \pi),\ C_2: y=k\cos x\ (0\leqq x\leqq \pi).$ Denote by $S(k)$ the sum of the areas of four parts enclosed by $C_1,\ C_2$ and two lines $x=0,\ x=\pi$. Find the minimum value of $S(k).$ [i]2010 Nagoya Institute of Technology entrance exam[/i]

[b]a)[/b] Show that two real numbers $ x,y>1 $ chosen so that $ x^y=y^x, $ are equal or there exists a positive real number $ m\neq 1 $ such that $ x=m^{\frac{1}{m-1}} $ and $ y=m^{\frac{m}{m-1}} . $ [b]b)[/b] Solve in $ \left( 1,\infty \right)^2 $ the equation: $ x^y+x^{x^{y-1}}=y^x+y^{y^{x-1}} . $

Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as \[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \] where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.

$f$ be a twice differentiable real valued function satisfying \[ f(x)+f^{\prime\prime}(x)=-xg(x)f^{\prime}(x) \] where $g(x)\ge 0$ for all real $x$. Show that $|f(x)|$ is bounded.

Let \[f(n)=\dfrac{5+3\sqrt{5}}{10}\left(\dfrac{1+\sqrt{5}}{2}\right)^n+\dfrac{5-3\sqrt{5}}{10}\left(\dfrac{1-\sqrt{5}}{2}\right)^n.\] Then $f(n+1)-f(n-1)$, expressed in terms of $f(n)$, equals: $\textbf{(A)}\ \dfrac{1}{2}f(n) \qquad \textbf{(B)}\ f(n)\qquad \textbf{(C)}\ 2f(n)+1 \qquad \textbf{(D)}\ f^2(n) \qquad \textbf{(E)}\ \dfrac{1}{2}(f^2(n)-1)$

Prove that there are infinitely many positive integers $n$ such that $2^{2^n+1}+1$ is divisible by $n$ but $2^n+1$ is not. [i](Russia) Valery Senderov[/i]

Let $n$ be integer, $n>1.$ An element of the set $M=\{ 1,2,3,\ldots,n^2-1\}$ is called [i]good[/i] if there exists some element $b$ of $M$ such that $ab-b$ is divisible by $n^2.$ Furthermore, an element $a$ is called [i]very good[/i] if $a^2-a$ is divisible by $n^2.$ Let $g$ denote the number of [i]good[/i] elements in $M$ and $v$ denote the number of [i]very good[/i] elements in $M.$ Prove that \[v^2+v \leq g \leq n^2-n.\]

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

For arbitrary real number $x$, the function $f : \mathbb R \to \mathbb R$ satisfies $f(f(x))-x^2+x+3=0$. Show that the function $f$ does not exist.

Let $f,g,h:\mathbb{R}\rightarrow \mathbb{R}$ such that $f$ is differentiable, $g$ and $h$ are monotonic, and $f'=f+g+h$. Prove that the set of the points of discontinuity of $g$ coincides with the respective set of $h$.

Let $f\in C^3(\mathbb{R})$ nonnegative function with $f(0)=f'(0)=0, f''(0)>0$. Define $g(x)$ as follows: \[ \{ \begin{array}{ccc}g(x)= (\frac{\sqrt{f(x)}}{f'(x)})' &\text{for}& x\not=0 \\ g(x)=0 &\text{for}& x=0\end{array} \] (a) Show that $g$ is bounded in some neighbourhood of $0$. (b) Is the above true for $f\in C^2(\mathbb{R})$?

Prove the inequality: \[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\] for positive reals $ a_{1},a_{2},\ldots,a_{n}$. [i]Proposed by Dusan Dukic, Serbia[/i]

Let $S$ be a finite set, and let $\mathcal{A}$ be the set of all functions from $S$ to $S$. Let $f$ be an element of $\mathcal{A}$, and let $T=f(S)$ be the image of $S$ under $f$. Suppose that $f\circ g\circ f\ne g\circ f\circ g$ for every $g$ in $\mathcal{A}$ with $g\ne f$. Show that $f(T)=T$.

Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N} $ satisfying \[ f(mn) = \operatorname{lcm} (m,n) \cdot \gcd( f(m), f(n) ) \] for all positive integer $m,n$.

Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that \[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]

Let $a,b,c>0$ the sides of a right triangle. Find all real $x$ for which $a^x>b^x+c^x$, with $a$ is the longest side.

Consider the function $f : N \to N$ given by (i) $f(1) = 1$, (ii) $f(2n) = f(n)$ for any $n \in N$, (iii) $f(2n+1) = f(2n)+1$ for any $n \in N$. (a) Find the maximum value of $f(n)$ for $1 \le n \le 1995$; (b) Find all values of $f$ on this interval.