Let $S$ be the set of all pairs $(m,n)$ of relatively prime positive integers $m,n$ with $n$ even and $m < n.$ For $s = (m,n) \in S$ write $n = 2^k \cdot n_o$ where $k, n_0$ are positive integers with $n_0$ odd and define \[ f(s) = (n_0, m + n - n_0). \] Prove that $f$ is a function from $S$ to $S$ and that for each $s = (m,n) \in S,$ there exists a positive integer $t \leq \frac{m+n+1}{4}$ such that \[ f^t(s) = s, \] where \[ f^t(s) = \underbrace{ (f \circ f \circ \cdots \circ f) }_{t \text{ times}}(s). \] If $m+n$ is a prime number which does not divide $2^k - 1$ for $k = 1,2, \ldots, m+n-2,$ prove that the smallest value $t$ which satisfies the above conditions is $\left [\frac{m+n+1}{4} \right ]$ where $\left[ x \right]$ denotes the greatest integer $\leq x.$

Prove that the set of rational-valued, multiplicative arithmetical functions and the set of complex rational-valued, multiplicative arithmetical functions form isomorphic groups with the convolution operation $ f \circ g$ defined by \[{ (f \circ g)(n)= %Error. "displatmath" is a bad command. \sum_{d|n} f(d)g(\frac nd}).\] (We call a complex number $ \textit{complex rational}$, if its real and imaginary parts are both rational.) [i]B. Csakany[/i]

Let $ k\geq 1 $ and let $ I_{1},\dots, I_{k} $ be non-degenerate subintervals of the interval $ [0, 1] $. Prove that \[ \sum \frac{1}{\left | I_{i}\cup I_{j} \right |} \geq k^{2} \] where the summation is over all pairs $ (i, j) $ of indices such that $I_i\cap I_j\neq \emptyset$.

Find the number of functions $f$ that map the set $\{1,2, 3,4\}$ into itself such that the range of the function $f(x)$ is the same as the range of the function $f(f(x))$.

In a triangle $ABC$, points $X$ and $Y$ are on $BC$ and $CA$ respectively such that $CX=CY$,$AX$ is not perpendicular to $BC$ and $BY$ is not perpendicular to $CA$.Let $\Gamma$ be the circle with $C$ as centre and $CX$ as its radius.Find the angles of triangle $ABC$ given that the orthocentres of triangles $AXB$ and $AYB$ lie on $\Gamma$.

Let $\mathbb R^\ast$ denote the set of nonzero reals. Find all functions $f: \mathbb R^\ast \to \mathbb R^\ast$ satisfying \[ f(x^2+y)+1=f(x^2+1)+\frac{f(xy)}{f(x)} \] for all $x,y \in \mathbb R^\ast$ with $x^2+y\neq 0$. [i]Proposed by Ryan Alweiss[/i]

Define the functions $f, F : \mathbb N \to \mathbb N$, by \[f(n)=\left[ \frac{3-\sqrt 5}{2} n \right] , F(k) =\min \{n \in \mathbb N|f^k(n) > 0 \},\] where $f^k = f \circ \cdots \circ f$ is $f$ iterated $n$ times. Prove that $F(k + 2) = 3F(k + 1) - F(k)$ for all $k \in \mathbb N.$

Find all non-constant polynoms $ f\in\mathbb{Q} [X] $ that don't have any real roots in the interval $ [0,1] $ and for which there exists a function $ \xi :[0,1]\longrightarrow\mathbb{Q} [X]\times\mathbb{Q} [X], \xi (x):=\left( g_x,h_x \right) $ such that $ h_x(x)\neq 0 $ and $ \int_0^x \frac{dt}{f(t)} =\frac{g_x(x)}{h_x(x)} , $ for all $ x\in [0,1] . $

Find all functions $f:\mathbb{R}\to\mathbb{R}$ so that $(x+y)(f(x)-f(y))=(x-y)f(x+y)$ for all $x,y$ that belongs to $\mathbb{R}$.

Find the functions $f: \mathbb{R} \to \mathbb{R}$ that satisfy $$(f(x)-y)f(x+f(y))=f(x^2)-yf(y),$$ for all real numbers $x$ and $y.$

How many polynomial functions $f$ of degree $\ge 1$ satisfy \[ f(x^2)=[f(x)]^2=f(f(x)) \ ? \] $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ \text{finitely many but more than 2} \\ \qquad\textbf{(E)}\ \text{infinitely many} $

Find all functions $f:\mathbb{Z}_{>0}\mapsto\mathbb{Z}_{>0}$ such that $$xf(x)+(f(y))^2+2xf(y)$$ is perfect square for all positive integers $x,y$. **This problem was proposed by me for the BMO 2017 and it was shortlisted. We then used it in our TST.

Denote by $\mathbb{Q}^+$ the set of all positive rational numbers. Determine all functions $f : \mathbb{Q}^+ \mapsto \mathbb{Q}^+$ which satisfy the following equation for all $x, y \in \mathbb{Q}^+:$ \[f\left( f(x)^2y \right) = x^3 f(xy).\] [i]Proposed by Thomas Huber, Switzerland[/i]

$a > 0$ and $b$, $c$ are integers such that $ac$ – $b^2$ is a square-free positive integer P. [hide="For example"] P could be $3*5$, but not $3^2*5$.[/hide] Let $f(n)$ be the number of pairs of integers $d, e$ such that $ad^2 + 2bde + ce^2= n$. Show that$f(n)$ is finite and that $f(n) = f(P^{k}n)$ for every positive integer $k$. [b]Original Statement:[/b] Let $a,b,c$ be given integers $a > 0,$ $ac-b^2 = P = P_1 \cdots P_n$ where $P_1 \cdots P_n$ are (distinct) prime numbers. Let $M(n)$ denote the number of pairs of integers $(x,y)$ for which \[ ax^2 + 2bxy + cy^2 = n. \] Prove that $M(n)$ is finite and $M(n) = M(P_k \cdot n)$ for every integer $k \geq 0.$ Note that the "$n$" in $P_N$ and the "$n$" in $M(n)$ do not have to be the same.

Let $ a\in\mathbb{R}. $ Prove the following proposition: $$ \left( x,y\in\mathbb{R}\implies x^4+y^4+axy+2\ge 0 \right)\iff |a|\le 4. $$

Given a regular tetrahedron $ABCD$ with edge length $1$ and a point $P$ inside it. What is the maximum value of $\left|PA\right|+\left|PB\right|+\left|PC\right|+\left|PD\right|$.

If the equation: $f(\frac{x-3}{x+1}) + f(\frac{3+x}{1-x}) = x$ holds true for all real x but $\pm 1$, find $f(x)$.

Prove that every nonzero coefficient of the Taylor series of $(1-x+x^2)e^x$ about $x=0$ is a rational number whose numerator (in lowest terms) is either $1$ or a prime number.

Let $A$ be the set of all functions $f:\mathbb{R} \to \mathbb{R}$ such that $f(xy)=xf(y)$ for all $x,y \in \mathbb{R}$. (a) If $f \in A$ then show that $f(x+y)=f(x)+f(y)$ for all $x,y \in \mathbb{R}$ (b) For $g,h \in A$, define a function $g\circ h$ by $(g \circ h)(x)=g(h(x))$ for $x \in \mathbb{R}$. Prove that $g \circ h$ is in $A$ and is equal to $h \circ g$.

Find all functions $f: \mathbb{Q}\to \mathbb{Q}$ such that for all $x,y,z \in \mathbb{Q}$: \[f(x+y+z)+f(x-y)+f(y-z)+f(z-x)=3f(x)+3f(y)+3f(z).\]

Let $ n $ be an integer greater than or equal to $ 2 $. Prove that if the real numbers $ a_1 , a_2 , \cdots , a_n $ satisfy $ a_1 ^2 + a_2 ^2 + \cdots + a_n ^ 2 = n $, then \[\sum_{1 \le i < j \le n} \frac{1}{n- a_i a_j} \le \frac{n}{2} \] must hold.

Let $ T$ denote the set of all ordered triples $ (p,q,r)$ of nonnegative integers. Find all functions $ f: T \rightarrow \mathbb{R}$ satisfying \[ f(p,q,r) = \begin{cases} 0 & \text{if} \; pqr = 0, \\ 1 + \frac{1}{6}(f(p + 1,q - 1,r) + f(p - 1,q + 1,r) & \\ + f(p - 1,q,r + 1) + f(p + 1,q,r - 1) & \\ + f(p,q + 1,r - 1) + f(p,q - 1,r + 1)) & \text{otherwise} \end{cases} \] for all nonnegative integers $ p$, $ q$, $ r$.

Let $ f[0,\infty )\longrightarrow\mathbb{R} $ be a convex and differentiable function with $ f(0)=0. $ [b]a)[/b] Prove that $ \int_0^x f(t)dt\le \frac{x^2}{2}f'(x) , $ for any nonnegative $ x. $ [b]b)[/b] Determine $ f $ if the above inequality is actually an equality. [i]Dorin Andrica[/i] and [i]Mihai Piticari[/i]

Let $f : \left[ 0, 1 \right] \to \mathbb R$ be a continuous function and $g : \left[ 0, 1 \right] \to \left( 0, \infty \right)$. Prove that if $f$ is increasing, then \[\int_{0}^{t}f(x) g(x) \, dx \cdot \int_{0}^{1}g(x) \, dx \leq \int_{0}^{t}g(x) \, dx \cdot \int_{0}^{1}f(x) g(x) \, dx .\]

Find all function $ f: \mathbb{N}\rightarrow\mathbb{N}$ satisfy $ f(mn)\plus{}f(m\plus{}n)\equal{}f(m)f(n)\plus{}1$ for all natural number $ n$