Let $ f(n)$ be a function defined on the set of all positive integers and having its values in the same set. Suppose that $ f(f(n) \plus{} f(m)) \equal{} m \plus{} n$ for all positive integers $ n,m.$ Find the possible value for $ f(1988).$

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

Show that a function $ f(x)\equal{}\int_{\minus{}1}^1 (1\minus{}|\ t\ |)\cos (xt)\ dt$ is continuous at $ x\equal{}0$.

Consider the region $A$ in the complex plane that consists of all points $z$ such that both $\frac{z}{40}$ and $\frac{40}{\overline{z}}$ have real and imaginary parts between $0$ and $1$, inclusive. What is the integer that is nearest the area of $A$?

Let $f,g:\mathbb{R}\to\mathbb{R}$ be two nondecreasing functions. [list=a] [*]Show that for any $a\in\mathbb{R},$ $b\in[f(a-0),f(a+0)]$ and $x\in\mathbb{R},$ the following inequality holds \[\int_a^xf(t) \ dt\geq b(x-a).\] [*]Given that $[f(a-0),f(a+0)]\cap[g(a-0),g(a+0)]\neq\emptyset$ for any $a\in\mathbb{R},$ prove that for any real numbers $a<b$\[\int_a^b f(t) \ dt=\int_a^b g(t) \ dt.\] [/list] [i]Note: $h(a-0)$ and $h(a+0)$ denote the limits to the left and to the right respectively of a function $h$ at point $a\in\mathbb{R}.$[/i]

Let $I$ and $J$ be intervals. Let $\varphi,\psi:I\to\mathbb{R}$ be strictly increasing continuous functions and let $\Phi,\Psi:J\to\mathbb{R}$ be continuous functions. Suppose that $\varphi(x)+\psi(x)=x$ and $\Phi(u)+\Psi(u)=u$ holds for all $x\in I$ and $u\in J$. Show that if $f:I\to J$ is a continuous solution of the functional inequality $$f\big(\varphi(x)+\psi(y)\big)\le \Phi\big(f(x)\big)+\Psi\big(f(y)\big)\qquad (x,y\in I),$$then $\Phi\circ f\circ \varphi^{-1}$ and $\Psi\circ f\circ \psi^{-1}$ are convex functions.

Denote by $m(a,b)$ the arithmetic mean of positive real numbers $a,b$. Given a positive real function $g$ having positive derivatives of the first and second order, define $\mu (a,b)$ the mean value of $a$ and $b$ with respect to $g$ by $2g(\mu (a,b)) = g(a)+g(b)$. Decide which of the two mean values $m$ and $\mu$ is larger.

Let $f, g$ be functions $\mathbb{R} \rightarrow \mathbb{R}$ such that for all reals $x,y$, $$f(g(x) + y) = g(x + y)$$ Prove that either $f$ is the identity function or $g$ is periodic. [i]Proposed by Pranjal Srivastava[/i]

Let $P$ be a point on the graph of the function $y=x+\frac{2}{x}(x>0)$. $PA,PB$ are perpendicular to line $y=x$ and $x=0$, respectively, the feet of perpendicular being $A$ and $B$. Find the value of $\overrightarrow{PA}\cdot \overrightarrow{PB}$.

Let $f:[0,1]\rightarrow \mathbb{R}$ a differentiable function such that $f(0)=f(1)=0$ and $|f'(x)|\le 1,\ \forall x\in [0,1]$. Prove that: \[\left|\int_0 ^1f(t)dt\right|<\frac{1}{4}\]

Prove that there exists a function $f\colon [\omega_1]^2 \rightarrow \omega _1$ such that (i) $f(\alpha, \beta)< \mathrm{min}(\alpha, \beta)$ whenever $\mathrm{min}(\alpha,\beta)>0$; and (ii) if $\alpha_0<\alpha_1<\ldots<\alpha_i<\ldots<\omega_1$ then $\sup\left\{ a_i \colon i<\omega \right\} =\sup \left\{ f(\alpha_i, \alpha_j)\colon i,j<\omega\right\}$.

Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]

Find all differentiable functions $ f:(0,\infty )\longrightarrow (-\infty ,\infty ) $ having the property that $$ f'(\sqrt{x}) =\frac{1+x+x^2}{1+x} , $$ for any positive real numbers $ x. $ [i]Ovidiu Țâțan[/i]

Let $a, b$ be two nonnegative real numbers and $n$ a positive integer. Prove that \[\left(1-2^{-n}\right)\left|a^{2^n}-b^{2^n}\right|\ge\sqrt{ab}\left|a^{2^n-1}-b^{2^n-1}\right|.\]

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]

For a positive integer $n$, let $f(n)$ be the sum of the positive integers that divide at least one of the nonzero base $10$ digits of $n$. For example, $f(96)=1+2+3+6+9=21$. Find the largest positive integer $n$ such that for all positive integers $k$, there is some positive integer $a$ such that $f^k(a)=n$, where $f^k(a)$ denotes $f$ applied $k$ times to $a$. [i]2021 CCA Math Bonanza Lightning Round #4.3[/i]

Carl chooses a [i]functional expression[/i]* $E$ which is a finite nonempty string formed from a set $x_1, x_2, \dots$ of variables and applications of a function $f$, together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation $E = 0$, and lets $S$ denote the set of functions $f \colon \mathbb R \to \mathbb R$ such that the equation holds for any choices of real numbers $x_1, x_2, \dots$. (For example, if Carl chooses the functional equation $$ f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, $$ then $S$ consists of one function, the identity function. (a) Let $X$ denote the set of functions with domain $\mathbb R$ and image exactly $\mathbb Z$. Show that Carl can choose his functional equation such that $S$ is nonempty but $S \subseteq X$. (b) Can Carl choose his functional equation such that $|S|=1$ and $S \subseteq X$? *These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer $i$, the variable $x_i$ is a functional expression, and (iii) if $V$ and $W$ are functional expressions, then so are $f(V)$, $V+W$, $V-W$, and $V \cdot W$. [i]Proposed by Carl Schildkraut[/i]

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. Consider a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$. For any $m, n \in \mathbb{Z}_{>0}$ we write $f^n(m) = \underbrace{f(f(\ldots f}_{n}(m)\ldots))$. Suppose that $f$ has the following two properties: (i) if $m, n \in \mathbb{Z}_{>0}$, then $\frac{f^n(m) - m}{n} \in \mathbb{Z}_{>0}$; (ii) The set $\mathbb{Z}_{>0} \setminus \{f(n) \mid n\in \mathbb{Z}_{>0}\}$ is finite. Prove that the sequence $f(1) - 1, f(2) - 2, f(3) - 3, \ldots$ is periodic. [i]Proposed by Ang Jie Jun, Singapore[/i]

Find all functions from positive integers to itself such that $f(a+b)=f(a)+f(b)+f(c)+f(d)$ for all $c^2+d^2=2ab$

The function $f(x) = ax + b$ satisfies the following equalities: \begin{align*} f(f(f(1))) &= 2023, \\ f(f(f(0))) &= 1996. \end{align*} Find the value of $a$.

Let $f : Z_+ \to Z_+$ such that: a) $f(n + 1) > f(n)$ for all $n \in Z_+$ b) $f(n + f(m)) = f(n) + m + 1$ for all $n,m \in Z_+$ Find $f(2006)$.

A cat is trying to catch a mouse in the non-negative quadrant \[N=\{(x_1,x_2)\in \mathbb{R}^2: x_1,x_2\geq 0\}.\] At time $t=0$ the cat is at $(1,1)$ and the mouse is at $(0,0)$. The cat moves with speed $\sqrt{2}$ such that the position $c(t)=(c_1(t),c_2(t))$ is continuous, and differentiable except at finitely many points; while the mouse moves with speed $1$ such that its position $m(t)=(m_1(t),m_2(t))$ is also continuous, and differentiable except at finitely many points. Thus $c(0)=(1,1)$ and $m(0)=(0,0)$; $c(t)$ and $m(t)$ are continuous functions of $t$ such that $c(t),m(t)\in N$ for all $t\geq 0$; the derivatives $c'(t)=(c'_1(t),c'_2(t))$ and $m'(t)=(m'_1(t),m'_2(t))$ each exist for all but finitely many $t$ and \[(c'_1(t)^2+(c'_2(t))^2=2 \qquad (m'_1(t)^2+(m'_2(t))^2=1,\] whenever the respective derivative exists. At each time $t$ the cat knows both the mouse's position $m(t)$ and velocity $m'(t)$. Show that, no matter how the mouse moves, the cat can catch it by time $t=1$; that is, show that the cat can move such that $c(\tau)=m(\tau)$ for some $\tau\in[0,1]$.

Suppose $f:\mathbb{R}\to \mathbb{R}$ is a two times differentiable function satisfying $f(0)=1,f^{\prime}(0)=0$ and for all $x\in [0,\infty)$, it satisfies \[ f^{\prime \prime}(x)-5f^{\prime}(x)+6f(x)\ge 0 \] Prove that, for all $x\in [0,\infty)$, \[ f(x)\ge 3e^{2x}-2e^{3x} \]

For real numbers $a,b,c,d$ not all equal to $0$ , define a real function $f(x) = a +b\cos{2x} + c\sin{5x} +d \cos{8x}$. Suppose $f(t) = 4a$ for some real $t$. prove that there exist a real number $s$ s.t. $f(s)<0$

The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\] a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$. b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution. c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.