The functions $f_0, f_1, f_2, ...$ are defined on the reals by $f_0(x) = 8$ for all $x$, $f_{n+1}(x) = \sqrt{x^2 + 6f_n(x)}$. For all $n$ solve the equation $f_n(x) = 2x$.

Calculate $ \lim_{n\to\infty } \frac{f(1)+(f(2))^2+\cdots +(f(n))^n}{(f(n))^n} , $ where $ f:\mathbb{R}\longrightarrow\mathbb{R}_{>0 } $ is an unbounded and nondecreasing function. [i]Dan Popescu[/i]

The function $f(n)$ is defined on the nonnegative integers $n$ by: $f(0) = 0, f(1) = 1$, and \[f(n) = f\left(n -\frac{1}{2}m(m - 1)\right)-f\left(\frac{1}{2}m(m+ 1)-n\right)\] for $\frac{1}{2}m(m - 1) < n \le \frac{1}{2}m(m+ 1), m \ge 2$. Find the smallest integer $n$ for which $f(n) = 5$.

Consider pairs of functions $(f, g)$ from the set of nonnegative integers to itself such that [list] [*] $f(0) + f(1) + f(2) + \cdots + f(42) \le 2022$; [*] for any integers $a \ge b \ge 0$, we have $g(a+b) \le f(a) + f(b)$. [/list] Determine the maximum possible value of $g(0) + g(1) + g(2) + \cdots + g(84)$ over all such pairs of functions. [i]Evan Chen (adapting from TST3, by Sean Li)[/i]

Let $g(t)$ be the minimum value of $f(x)=x2^{-x}$ in $t\leq x\leq t+1$. Evaluate $\int_0^2 g(t)dt$. [i]2010 Kumamoto University entrance exam/Science[/i]

Find all ordered pairs of integers $(a,b)$ such that there exists a function $f\colon \mathbb{N} \to \mathbb{N}$ satisfying $$f^{f(n)}(n)=an+b$$ For all $n\in \mathbb{N}$.

Does there exist a function $f : \mathbb{R} \rightarrow \mathbb{R}$, which satisfies both conditions : [b]a)[/b] $f( x + y + z) \leq 3(xy + yz + zx)$ for all real numbers $x , y , z$ and [b]b)[/b] there exist function $g$ and natural number $n$, such that $g(g(x)) = x ^ {2n + 1}$ and $f(g(x)) = (g(x)) ^2$ for every real number $x$ ?

Let $T$ the set of the infinite sequences of integers. For two given elements in $T$: $(a_{1},a_{2},a_{3},...)$ and $(b_{1},b_{2},b_{3},...)$, define the sum $(a_{1},a_{2},a_{3},...)+(b_{1},b_{2},b_{3},...)=(a_{1}+b_{1},a_{2}+b_{2},a_{3}+b_{3},...)$. Let $f: T\rightarrow$ $\mathbb{Z}$ a function such that: i) If $x\in T$ has exactly one of your terms equal $1$ and all the others equal $0$, then $f(x)=0$. ii)$f(x+y)=f(x)+f(y)$, for all $x,y\in T$. Prove that $f(x)=0$ for all $x\in T$

Answer the questions as below. (1) Find the local minimum of $y=x(1-x^2)e^{x^2}.$ (2) Find the total area of the part bounded the graph of the function in (1) and the $x$-axis.

Find the range of $ f(A)=\frac{\sin A(3\cos^{2}A+\cos^{4}A+3\sin^{2}A+\sin^{2}A\cos^{2}A)}{\tan A (\sec A-\sin A\tan A)} $ if $A\neq \dfrac{n\pi}{2}$.

We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

Given a number $n\in\mathbb{Z}^+$ and let $S$ denotes the set $\{0,1,2,...,2n+1\}$. Consider the function $f:\mathbb{Z}\times S\to [0,1]$ satisfying two following conditions simultaneously: i) $f(x,0)=f(x,2n+1)=0\forall x\in\mathbb{Z}$; ii) $f(x-1,y)+f(x+1,y)+f(x,y-1)+f(x,y+1)=1$ for all $x\in\mathbb{Z}$ and $y\in\{1,2,3,...,2n\}$. Let $F$ be the set of such functions. For each $f\in F$, let $v(f)$ be the set of values of $f$. a) Proof that $|F|=\infty$. b) Proof that for each $f\in F$ then $|v(f)|<\infty$. c) Find the maximum value of $|v(f)|$ for $f\in F$.

Evaluate: $\lim_{n\to\infty} \frac{1}{2n} \ln\binom{2n}{n}$

Given two positive integers $n$ and $m$ and a function $f : \mathbb{Z} \times \mathbb{Z} \to \left\{0,1\right\}$ with the property that \begin{align*} f\left(i, j\right) = f\left(i+n, j\right) = f\left(i, j+m\right) \qquad \text{for all } \left(i, j\right) \in \mathbb{Z} \times \mathbb{Z} . \end{align*} Let $\left[k\right] = \left\{1,2,\ldots,k\right\}$ for each positive integer $k$. Let $a$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i+1, j\right) = f\left(i, j+1\right) . \end{align*} Let $b$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying \begin{align*} f\left(i, j\right) = f\left(i-1, j\right) = f\left(i, j-1\right) . \end{align*} Prove that $a = b$.