Let $a,b,c > 0$ and $ab+bc+ca = 1$. Prove that: \[ \sqrt {a^3 + a} + \sqrt {b^3 + b} + \sqrt {c^3 + c}\geq2\sqrt {a + b + c}. \]

Let $t_1 < t_2 < t_3 < \cdots < t_{99}$ be real numbers. Consider a function $f: \mathbb{R} \to \mathbb{R}$ given by $f(x)=|x-t_1|+|x-t_2|+...+|x-t_{99}|$ . Show that $f(x)$ will attain minimum value at $x=t_{50}$.

In the following, let $N_0$ denotes the set of non-negative integers. Find all polynomials $P(x)$ that fulfill the following two properties: (1) All coefficients of $P(x)$ are from $N_0$. (2) Exists a function $f : N_0 \to N_0$ such as $f (f (f (n))) = P (n)$ for all $n \in N_0$.

Suppose we have some proteins that each protein is a sequence of 7 "AMINO-ACIDS" $A,\ B,\ C,\ H,\ F,\ N$. For example $AFHNNNHAFFC$ is a protein. There are some steps that in each step an amino-acid will change to another one. For example with the step $NA\rightarrow N$ the protein $BANANA$ will cahnge to $BANNA$("in Persian means workman"). We have a set of allowed steps that each protein can change with these steps. For example with the set of steps: $\\ 1)\ AA\longrightarrow A\\ 2)\ AB\longrightarrow BA\\ 3)\ A\longrightarrow \mbox{null}$ Protein $ABBAABA$ will change like this: $\\ ABB\underline{AA}BA\\ \underline{AB}BABA\\ B\underline{AB}ABA\\ BB\underline{AA}BA\\ BB\underline{AB}A\\ BBB\underline{AA}\\ BBB\underline{A}\\ BBB$ You see after finite steps this protein will finish it steps. Set of allowed steps that for them there exist a protein that may have infinitely many steps is dangerous. Which of the following allowed sets are dangerous? a) $NO\longrightarrow OONN$ b) $\left\{\begin{array}{c}HHCC\longrightarrow HCCH\\ CC\longrightarrow CH\end{array}\right.$ c) Design a set of allowed steps that change $\underbrace{AA\dots A}_{n}\longrightarrow\underbrace{BB\dots B}_{2^{n}}$ d) Design a set of allowed steps that change $\underbrace{A\dots A}_{n}\underbrace{B\dots B}_{m}\longrightarrow\underbrace{CC\dots C}_{mn}$ You see from $c$ and $d$ that we acn calculate the functions $F(n)=2^{n}$ and $G(M,N)=mn$ with these steps. Find some other calculatable functions with these steps. (It has some extra mark.)

A function $f$ is defined on the positive integers by \[\left\{\begin{array}{rcl}f(1) &=& 1, \\ f(3) &=& 3, \\ f(2n) &=& f(n), \\ f(4n+1) &=& 2f(2n+1)-f(n), \\ f(4n+3) &=& 3f(2n+1)-2f(n), \end{array}\right.\] for all positive integers $n$. Determine the number of positive integers $n$, less than or equal to 1988, for which $f(n) = n$.

A cubic funtion $ y \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d\ (a\neq 0)$ intersects with the line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha ,\ \beta ,\ \gamma\ (\alpha < \beta < \gamma).$ Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta ,\ \gamma$.

Given a positive integer $n$, find the greatest integer $p$ with the property that for any function $f : \mathbb P(X) \to C$, where $X$ and $C$ are sets of cardinality $n$ and $p$, respectively, there exist two distinct sets $A,B \in \mathbb P(X)$ such that $f(A) = f(B) = f(A \cup B)$. ($\mathbb P(X)$ is the family of all subsets of $X$.)

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]

How many hours does it take a train traveling at an average rate of $ 40$ mph between stops to travel $ a$ miles it makes $ n$ stops of $ m$ minutes each? $ \textbf{(A)}\ \frac{3a\plus{}2mn}{120} \qquad \textbf{(B)}\ 3a\plus{}2mn \qquad \textbf{(C)}\ \frac{3a\plus{}2mn}{12} \qquad \textbf{(D)}\ \frac{a\plus{}mn}{40} \qquad \textbf{(E)}\ \frac{a\plus{}40mn}{40}$

Let $a,b,c \in \left[ \frac 12, 1 \right]$. Prove that \[ 2 \leq \frac{ a+b}{1+c} + \frac{ b+c}{1+a} + \frac{ c+a}{1+b} \leq 3 . \] [i]selected by Mircea Lascu[/i]

Let $\tau(x)$ be the number of positive divisors of $x$ (including $1$ and $x$). Find \[\tau\left( \tau\left( \dots \tau\left(2024^{2024^{2024}}\right) \right)\right),\] where there are $4202^{4202^{4202}}$ $\tau$'s. [i]Lightning 2.1[/i]

Known $f:\mathbb{N}_0 \to \mathbb{N}_0$ function for $\forall x,y\in \mathbb{N}_0$ the following terms are paid $(a). f(0,y)=y+1$ $(b). f(x+1,0)=f(x,1)$ $(c). f(x+1,y+1)=f(x,f(x+1,y)).$ Find the value if $f(4,1981)$

Prove that for $k>10$ Nazar may replace in the following product some one $\cos$ by $\sin$ so that the new function $f_{1}(x)$ would satisfy inequality $|f_{1}(x)|\le 3\cdot 2^{-1-k}$ for all real $x$. \[f(x) = \cos x \cos 2x \cos 3x \dots \cos 2^{k}x \] [i]N. Agakhanov[/i]

Let $a, b, c$ be positive reals with $a^{2014}+b^{2014}+c^{2014}+abc=4$. Prove that \[ \frac{a^{2013}+b^{2013}-c}{c^{2013}} + \frac{b^{2013}+c^{2013}-a}{a^{2013}} + \frac{c^{2013}+a^{2013}-b}{b^{2013}} \ge a^{2012}+b^{2012}+c^{2012}. \][i]Proposed by David Stoner[/i]

Let $ X_1,X_2,\ldots, X_n$ be independent, identically distributed, nonnegative random variables with a common continuous distribution function $ F$. Suppose in addition that the inverse of $ F$, the quantile function $ Q$, is also continuous and $ Q(0)=0$. Let $ 0=X_{0: n} \leq X_{1: n} \leq \ldots \leq X_{n: n}$ be the ordered sample from the above random variables. Prove that if $ EX_1$ is finite, then the random variable \[ \Delta = \sup_{0\leq y \leq 1} \left| \frac 1n \sum_{i=1}^{\lfloor ny \rfloor +1} (n+1-i)(X_{i: n}-X_{i-1: n})- \int_0^y (1-u)dQ(u) \right|\] tends to zero with probability one as $ n \rightarrow \infty$. [i]S. Csorgp, L. Horvath[/i]