Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]

Prove that $ |f(x)|\le |f(0)| +\int_0^x |f(t) +f'(t)|dt , $ for any nonnegative real numbers $ x, $ and functions $f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ of class $ \mathcal{C}^1. $

Prove that $ \frac {( \minus{} 1)^n}{n!}\int_1^2 (\ln x)^n\ dx \equal{} 2\sum_{k \equal{} 1}^n \frac {( \minus{} \ln 2)^k}{k!} \plus{} 1$.

Let \( \mathbb{N} \) be the set of all positive integers. We say that a function \( f: \mathbb{N} \to \mathbb{N} \) is Georgian if \( f(1) = 1 \) and, for every positive integer \( n \), there exists a positive integer \( k \) such that \[ f^{(k)}(n) = 1, \quad \text{where } f^{(k)} = f \circ f \cdots \circ f \quad \text{(applied } k \text{ times)}. \] If \( f \) is a Georgian function, we define, for each positive integer \( n \), \( \text{ord}(n) \) as the smallest positive integer \( m \) such that \( f^{(m)}(n) = 1 \). Determine all positive real numbers \( c \) for which there exists a Georgian function such that, for every positive integer \( n \geq 2024 \), it holds that \( \text{ord}(n) \geq cn - 1 \).

Let $ \sigma(\cdot): \mathbb{N}_0 \to \mathbb{N}_0$ be the function from every positive integer $ n$ to the sum of divisors $ \sum_{d \mid n}{d}$ (i.e. $ \sigma(6) \equal{} 6 \plus{} 3 \plus{} 2 \plus{} 1$ and $ \sigma(8) \equal{} 8 \plus{} 4 \plus{} 2 \plus{} 1$). Find all primes $ p$ such that $ p \mid \sigma(p \minus{} 1)$. [i](Salvatore Tringali)[/i]

[color=darkblue]Weightlifter Ruslan has just finished the exercise with a weight, which has $ n$ small weights on one side and $ n$ on the another. At each stage he takes some weights from one of the sides, such that at any moment the difference of the numbers of weights on the sides does not exceed $ k$. What is the minimal number of stages (in function if $ n$ and $ k$), which Ruslan need to take off all weights..[/color]

A bus that moves along a 100 km route is equipped with a computer, which predicts how much more time is needed to arrive at its final destination. This prediction is made on the assumption that the average speed of the bus in the remaining part of the route is the same as that in the part already covered. Forty minutes after the departure of the bus, the computer predicts that the remaining travelling time will be 1 hour. And this predicted time remains the same for the next 5 hours. Could this possibly occur? If so, how many kilometers did the bus cover when these 5 hours passed? (Average speed is the number of kilometers covered divided by the time it took to cover them.)

Find all functions $f: \mathbb {R}^+ \times \mathbb {R}^+ \to \mathbb {R}^+$ that satisfy the following conditions for all positive real numbers $x,y,z:$ $$f\left ( f(x,y),z \right )=x^2y^2f(x,z)$$ $$f\left ( x,1+f(x,y) \right ) \ge x^2 + xyf(x,x)$$ [i]Proposed by Mojtaba Zare, Ali Daei Nabi[/i]

Let $ABC$ be a triangle and $I$ its incentre. Let $\varrho_1$ and $\varrho_2$ be the inradii of triangles $IAB$ and $IAC$ respectively. (a) Show that there exists a function $f: ( 0, \pi ) \mapsto \mathbb{R}$ such that \[ \frac{ \varrho_1}{ \varrho_2} = \frac{f(C)}{f(B)} \] where $B = \angle ABC$ and $C = \angle BCA$ (b) Prove that \[ 2 ( \sqrt{2} -1 ) < \frac{ \varrho_1} { \varrho_2} < \frac{ 1 + \sqrt{2}}{2} \]

Let $g: \mathbb{C} \rightarrow \mathbb{C}$ be a function, $w\in\mathbb{C}$ and $w^3=1$. Show that there exists a function $f:\mathbb{C} \rightarrow \mathbb{C}$ such that $f(z)+f(wz+a)=g(z), \forall z\in\mathbb{C}$. When there is an unique function $f$ with this property? Find it.

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

For any two nonnegative integers $n$ and $k$ satisfying $n\geq k$, we define the number $c(n,k)$ as follows: - $c\left(n,0\right)=c\left(n,n\right)=1$ for all $n\geq 0$; - $c\left(n+1,k\right)=2^{k}c\left(n,k\right)+c\left(n,k-1\right)$ for $n\geq k\geq 1$. Prove that $c\left(n,k\right)=c\left(n,n-k\right)$ for all $n\geq k\geq 0$.

Let \[ S_1 \equal{} \{ (x,y)\ | \ \log_{10} (1 \plus{} x^2 \plus{} y^2)\le 1 \plus{} \log_{10}(x \plus{} y)\} \]and \[ S_2 \equal{} \{ (x,y)\ | \ \log_{10} (2 \plus{} x^2 \plus{} y^2)\le 2 \plus{} \log_{10}(x \plus{} y)\}. \]What is the ratio of the area of $ S_2$ to the area of $ S_1$? $ \textbf{(A) } 98\qquad \textbf{(B) } 99\qquad \textbf{(C) } 100\qquad \textbf{(D) } 101\qquad \textbf{(E) } 102$

Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$. Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$. Find a closed form for $a_n$. [i]Proposed by Bobby Shen[/i]

For real $\theta_i$, $i = 1, 2, \dots, 2011$, where $\theta_1 = \theta_{2012}$, find the maximum value of the expression \[ \sum_{i=1}^{2011} \sin^{2012} \theta_i \cos^{2012} \theta_{i+1}. \] [i]Proposed by Lewis Chen [/i]

Let $A=\{a_1,a_2,\ldots,a_n\}$ be a set with $a_1<a_2\ldots<a_n$ and $B=\{b_1,b_2,\ldots,b_n\}$ be a set with $b_1<b_2\ldots<b_n$. Show that for every bijective function $f:A\rightarrow B$ the following relation takes place $$\max_{1\leq i\leq n} |a_i-f(a_i)| \geq \max_{1\leq i\leq n} |a_i-b_i|.$$

Let $f : \mathbb{R} \to \mathbb{R}$ be a function such that $|f(x)-f(y)| \leq |x-y|$, for all $x,y \in \mathbb{R}$. Prove that if for any real $x$, the sequence $x,f(x),f(f(x)),\ldots$ is an arithmetic progression, then there is $a \in \mathbb{R}$ such that $f(x)=x+a$, for all $x \in \mathbb R$.

We say that a natural number $ n\ge 4 $ is [i]unusual[/i] if, for any $ n\times n $ array of real numbers, the sum of the numbers from any $ 3\times 3 $ compact subarray is negative, and the sum of the numbers from any $ 4\times 4 $ compact subarray is positive. Find all unusual numbers.

Determine all the functions $ f: \mathbb{N}\rightarrow \mathbb{N}$ such that \[ f(n)\plus{}f(n\plus{}1)\plus{}f(f(n))\equal{}3n\plus{}1, \quad \forall n\in \mathbb{N}.\]

Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a function that satisfies the conditions: $ \text{(i)}\quad \lim_{x\to\infty} (f\circ f) (x) =\infty =-\lim_{x\to -\infty} (f\circ f) (x) $ $ \text{(ii)}\quad f $ has Darboux’s property [b]a)[/b] Prove that the limits of $ f $ at $ \pm\infty $ exist. [b]b)[/b] Is possible for the limits from [b]a)[/b] to be finite?

In the plane there is a worm of length 1. Prove that it can be always covered by means of half of a circular disk of diameter 1. [i]Note.[/i] Under a "worm", we understand a continuous curve. The "half of a circular disk" is a semicircle including its boundary.

Find all real numbers $x,y$ greater than $1$, satisfying the condition that the numbers $\sqrt{x-1}+\sqrt{y-1}$ and $\sqrt{x+1}+\sqrt{y+1}$ are nonconsecutive integers.

The domain of the function $f(x)=\log_{\frac12}(\log_4(\log_{\frac14}(\log_{16}(\log_{\frac1{16}}x))))$ is an interval of length $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $\textbf{(A) }19\qquad \textbf{(B) }31\qquad \textbf{(C) }271\qquad \textbf{(D) }319\qquad \textbf{(E) }511\qquad$

A continuous function $f : R \to R$ satisfies the conditions $f(1000) = 999$ and $f(x)f(f(x)) = 1$ for all real $x$. Determine $f(500)$.

Find all functions $ f:\mathbb{R}\rightarrow\mathbb{R} $ such that $f(x^2 - y^2) = (x+y)(f(x) - f(y))$ for all real numbers $x$ and $y$.