$ u,v,w > 0$,such that $ u \plus{} v \plus{} w \plus{} \sqrt {uvw} \equal{} 4$ prove that $ \sqrt {\frac {uv}{w}} \plus{} \sqrt {\frac {vw}{u}} \plus{} \sqrt {\frac {wu}{v}}\geq u \plus{} v \plus{} w$

For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$. [*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list] [i]Proposed by Bruno Le Floch, France[/i]

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.

An integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. [quote]For example, 4 can be partitioned in five distinct ways: 4 3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1[/quote] The number of partitions of n is given by the partition function $p\left ( n \right )$. So $p\left ( 4 \right ) = 5$ . Determine all the positive integers so that $p\left ( n \right )+p\left ( n+4 \right )=p\left ( n+2 \right )+p\left ( n+3 \right )$.

Square $ABCD$ is divided into four rectangles by $EF$ and $GH$. $EF$ is parallel to $AB$ and $GH$ parallel to $BC$. $\angle BAF = 18^\circ$. $EF$ and $GH$ meet at point $P$. The area of rectangle $PFCH$ is twice that of rectangle $AGPE$. Given that the value of $\angle FAH$ in degrees is $x$, find the nearest integer to $x$. [asy] size(100); defaultpen(linewidth(0.7)+fontsize(10)); pair D2(pair P) { dot(P,linewidth(3)); return P; } // NOTE: I've tampered with the angles to make the diagram not-to-scale. The correct numbers should be 72 instead of 76, and 45 instead of 55. pair A=(0,1), B=(0,0), C=(1,0), D=(1,1), F=intersectionpoints(A--A+2*dir(-76),B--C)[0], H=intersectionpoints(A--A+2*dir(-76+55),D--C)[0], E=F+(0,1), G=H-(1,0), P=intersectionpoints(E--F,G--H)[0]; draw(A--B--C--D--cycle); draw(F--A--H); draw(E--F); draw(G--H); label("$A$",D2(A),NW); label("$B$",D2(B),SW); label("$C$",D2(C),SE); label("$D$",D2(D),NE); label("$E$",D2(E),plain.N); label("$F$",D2(F),S); label("$G$",D2(G),W); label("$H$",D2(H),plain.E); label("$P$",D2(P),SE); [/asy]

Let $X_1,X_2,\ldots,X_m$ a numbering of the $m=2^n-1$ non-empty subsets of the set $\{1,2,\ldots,n\}$, $n\geq 2$. We consider the matrix $(a_{ij})_{1\leq i,j\leq m}$, where $a_{ij}=0$, if $X_i \cap X_j = \emptyset$, and $a_{ij}=1$ otherwise. Prove that the determinant $d$ of this matrix does not depend on the way the numbering was done and compute $d$.

Suppose that $n$ and $k$ are positive integers such that \[ 1 = \underbrace{\varphi( \varphi( \dots \varphi(}_{k\ \text{times}} n) \dots )). \] Prove that $n \le 3^k$. Here $\varphi(n)$ denotes Euler's totient function, i.e. $\varphi(n)$ denotes the number of elements of $\{1, \dots, n\}$ which are relatively prime to $n$. In particular, $\varphi(1) = 1$. [i]Proposed by Linus Hamilton[/i]

Let $ f$ be a function such that for all integers $ x$ and $ y$ applies $ f(x\plus{}y) \equal{} f(x) \plus{} f(y) \plus{} 6xy \plus{} 1$ and $ f(x) \equal{} f(\minus{}x)$. Then $ f(3)$ equals $ \text{(A)}\ 26 \qquad \text{(B)}\ 27 \qquad \text{(C)}\ 52 \qquad \text{(D)}\ 53 \qquad \text{(E)}\ 54$

Let $ n\geq 3 $ be an integer and let $ p\geq 2n-3 $ be a prime number. For a set $ M $ of $ n $ points in the plane, no 3 collinear, let $ f: M\to \{0,1,\ldots, p-1\} $ be a function such that (i) exactly one point of $ M $ maps to 0, (ii) if a circle $ \mathcal{C} $ passes through 3 distinct points of $ A,B,C\in M $ then $ \sum_{P\in M\cap \mathcal{C}} f(P) \equiv 0 \pmod p $. Prove that all the points in $ M $ lie on a circle.

Does there exist a pair $ (f; g)$ of strictly monotonic functions, both from $ \mathbb{N}$ to $ \mathbb{N}$, such that \[ f(g(g(n))) < g(f(n))\] for every $ n \in\mathbb{N}$?

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be the function as \[ f(x) = \begin{cases} \frac{1}{x-1}& (x > 1)\\ 1& (x=1)\\ \frac{x}{1-x} & (x<1) \end{cases} \] Let $x_1$ be a positive irrational number which is a zero of a quadratic polynomial with integer coefficients. For every positive integer $n$, let $x_{n+1} = f(x_n)$. Prove that there exists different positive integers $k$ and $\ell$ such that $x_k = x_\ell$.

Let $\mathbb{R}^+$ be the set of all positive real numbers. Show that there is no function $f:\mathbb{R}^+ \to \mathbb{R}^+$ satisfying \[f(x+y)=f(x)+f(y)+\dfrac{1}{2012}\] for all positive real numbers $x$ and $y$. [i]Proposer: Fajar Yuliawan[/i]

A figure $\Phi$ composed of unit squares has the following property: if the squares of an $m \times n$ rectangle ($m,n$ are fixed) are filled with numbers whose sum is positive, the figure $\Phi$ can be placed within the rectangle (possibly after being rotated) so that the sum of the covered numbers is also positive. Prove that a number of such figures can be put on the $m\times n$ rectangle so that each square is covered by the same number of figures.

Let $P:\mathbb{R} \to \mathbb{R}$ be a continuous function such that $P(X)=X$ has no real solution. Prove that $P(P(X))=X$ has no real solution.

Find all functions $ f \colon \mathbb{Z} \mapsto \mathbb{R}$ which satisfy: i) $ f(x)f(y) \equal{} f(x \plus{} y) \plus{} f(x \minus{} y)$ for all integers $ x$, $ y$ ii) $ f(0) \neq 0$ iii) $ f(1) \equal{} \frac {5}{2}$

Let $f: \mathbb Z^+ \to \mathbb Z$ be a function such that [b]a)[/b] $f(p)=1$ for every prime $p$. [b]b)[/b] $f(xy)=xf(y)+yf(x)$ for every pair of positive integers $x,y$ Find the least number $n \ge 2021$ such that $f(n)=n$

Find all functions $ f: \mathbb{R} \to \mathbb{R}$ satisfying \[ f\left(\frac {x \plus{} y}{x \minus{} y}\right) \equal{} \frac {f\left(x\right) \plus{} f\left(y\right)}{f\left(x\right) \minus{} f\left(y\right)} \] for all $ x \neq y$.

Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the maximum possible value of \[\sin^2x_1+\sin^2x_2+\sin^2x_3+\cdots+\sin^2x_{2007},\] where, for $1\leq i\leq 2007$, $x_i$ is a nonnegative real number, and \[x_1+x_2+x_3+\cdots+x_{2007}=\pi.\] Find the value of $a+b$.

Find $\lim_{n\to\infty} n\int_0^{\frac{\pi}{2}} \frac{1}{(1+\cos x)^n}dx\ (n=1,\ 2,\ \cdots).$

Evaluate the infinite sum \[\sum_{n \equal{} 0}^\infty \binom{2n}{n}\frac {1}{5^n}.\]

Let $ P(x)$ be the real polynomial function, $ P(x) \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d.$ Prove that if $ |P(x)| \leq 1$ for all $ x$ such that $ |x| \leq 1,$ then \[ |a| \plus{} |b| \plus{} |c| \plus{} |d| \leq 7.\]

Let $f : \mathbb{R}^+\to\mathbb{R}$ satisfying $f(x)=f(x+2)+2f(x^2+2x)$. Prove that if for all $x>1400^{2021}$, $xf(x) \le 2021$, then $xf(x) \le 2021$ for all $x \in \mathbb {R}^+$ Proposed by [i]Navid Safaei[/i]

The real numbers $a$, $b$, $c$, $d$ satisfy simultaneously the equations \[abc -d = 1, \ \ \ bcd - a = 2, \ \ \ cda- b = 3, \ \ \ dab - c = -6.\] Prove that $a + b + c + d \not = 0$.

Consider those functions $ f$ that satisfy $ f(x \plus{} 4) \plus{} f(x \minus{} 4) \equal{} f(x)$ for all real $ x$. Any such function is periodic, and there is a least common positive period $ p$ for all of them. Find $ p$. $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 24\qquad \textbf{(E)}\ 32$

Given the sets $R_{mn} = \{ (x,y) \mid x=0,1,\dots,m; y=0,1,\dots,n \}$, consider functions $f:R_{mn}\to \{-1,0,1\}$ with the following property: for each quadruple of points $A_1,A_2,A_3,A_4\in R_{mn}$ which form a square with side length $0<s<3$, we have $$f(A_1)+f(A_2)+f(A_3)+f(A_4)=0.$$ For each pair $(m,n)$ of positive integers, determine $F(m,n)$, the number of such functions $f$ on $R_{mn}$.