Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous, strictly decreasing function such that $f([0,1])\subseteq[0,1]$. [list=i] [*]For all positive integers $n{}$ prove that there exists a unique $a_n\in(0,1)$, solution of the equation $f(x)=x^n$. Moreover, if $(a_n){}$ is the sequence defined as above, prove that $\lim_{n\to\infty}a_n=1$. [*]Suppose $f$ has a continuous derivative, with $f(1)=0$ and $f'(1)<0$. For any $x\in\mathbb{R}$ we define \[F(x)=\int_x^1f(t) \ dt.\]Let $\alpha{}$ be a real number. Study the convergence of the series \[\sum_{n=1}^\infty F(a_n)^\alpha.\] [/list]

Let $C=\{4,6,8,9,10,\ldots\}$ be the set of composite positive integers. For each $n\in C$ let $a_n$ be the smallest positive integer $k$ such that $k!$ is divisible by $n$. Determine whether the following series converges: $$\sum_{n\in C}\left(\frac{a_n}{n}\right)^n.$$ [i]Proposed by Orif Ibrogimov, ETH Zurich and National University of Uzbekistan[/i]

Let $ \left( x_n \right)_{n\ge 1} $ be a sequence of positive real numbers, verifying the inequality $ x_n\le \frac{x_{n-1}+x_{n-2}}{2} , $ for any natural number $ n\ge 3. $ Show that $ \left( x_n \right)_{n\ge 1} $ is convergent.

A continuous function $f : [a,b] \to [a,b]$ is called piecewise monotone if $[a, b]$ can be subdivided into finitely many subintervals $$I_1 = [c_0,c_1], I_2 = [c_1,c_2], \dots , I_\ell = [ c_{\ell - 1},c_\ell ]$$ such that $f$ restricted to each interval $I_j$ is strictly monotone, either increasing or decreasing. Here we are assuming that $a = c_0 < c_1 < \cdots < c_{\ell - 1} < c_\ell = b$. We are also assuming that each $I_j$ is a maximal interval on which $f$ is strictly monotone. Such a maximal interval is called a lap of the function $f$, and the number $\ell = \ell (f)$ of distinct laps is called the lap number of $f$. If $f : [a,b] \to [a,b]$ is a continuous piecewise-monotone function, show that the sequence $( \sqrt[n]{\ell (f^n )})$ converges; here $f^n$ means $f$ composed with itself $n$-times, so $f^2 (x) = f(f(x))$ etc.

Given any real number $N_0,$ if $N_{j+1}= \cos N_j ,$ prove that $\lim_{j\to \infty} N_j$ exists and is independent of $N_0.$

Given a sequence $(a_n)$ of non-negative real numbers such that $a_{n+m}\leq a_{n} a_{m} $ for all pairs of positive integers $m$ and $n,$ prove that the sequence $(\sqrt[n]{a_n })$ converges.

Consider the sequence defined by $a_1 = 2022$ and $a_{n+1} = a_n + e^{-a_n}$ for $n \geq 1$. Prove that there exists a positive real number $r$ for which the sequence $$\{ra_1\}, \{ra_{10}\}, \{ra_{100}\}, . . . $$converges. [i]Note[/i]: $\{x \} = x - \lfloor x \rfloor$ denotes the part of $x$ after the decimal point. [i]Proposed by Ethan Tan[/i]

Suppose that $(a_n)$ is a sequence of real numbers such that the series $$\sum_{n=1}^\infty\frac{a_n}n$$is convergent. Show that the sequence $$b_n=\frac1n\sum^n_{j=1}a_j$$is convergent and find its limit.

If $\sum_{i=1}^{\infty} u_{i}^{2}$ and $\sum_{i=1}^{\infty} v_{i}^{2}$ are convergent series of real numbers, prove that $$\sum_{i=1}^{\infty}(u_{i}-v_{i})^{p}$$ is convergent, where $p\geq 2$ is an integer.

Let $a_n = \frac{1}{\binom{2n}{n}}, \forall n \leq 1$. a) Show that $\sum\limits_{n=1}^{+\infty}a_nx^n$ converges for all $x \in (-4, 4)$ and that the function $f(x) = \sum\limits_{n=1}^{+\infty}a_nx^n$ satisfies the differential equation $x(x - 4)f'(x) + (x + 2)f(x) = -x$. b) Prove that $\sum\limits_{n=1}^{+\infty}\frac{1}{\binom{2n}{n}} = \frac{1}{3} + \frac{2\pi\sqrt{3}}{27}$.

Let $f_0:[0,1]\to\mathbb R$ be a continuous function. Define the sequence of functions $f_n:[0,1]\to\mathbb R$ by $$f_n(x)=\int^x_0f_{n-1}(t)dt$$ for all integers $n\ge1$. a) Prove that the series $\sum_{n=1}^\infty f_n(x)$ is convergent for every $x\in[0,1]$. b) Find an explicit formula for the sum of the series $\sum_{n=1}^\infty f_n(x),x\in[0,1]$.

Let a sequence $(x_n)$ be given and let $y_n = x_{n-1} +2 x_n $ for $n>1.$ Suppose that the sequence $(y_n)$ converges. Prove that the sequence $(x_n)$ converges, too.

Find (i) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i^{2}}}$. (ii) $\lim_{n\to \infty} \sum_{i=1}^{n} \frac{1}{\sqrt{n^2 +i}}$. (iii) $\lim_{n\to \infty} \sum_{i=1}^{n^{2}} \frac{1}{\sqrt{n^2 +i}}$.

Let $\{a_n \}_n$ be a sequence of real numbers such there there are countably infinite distinct subsequences converging to the same point. We call two subsequences distinct if they do not have a common term. Which of the following statements always holds: (A) $\{a_n \}_n$ is bounded (B) $\{a_n \}_n$ is unbounded (C) The set of convergent subsequence $\{a_n \}_n$ is countable (D) None of these

Given a positive real number $a_1$, we recursively define $a_{n+1} = 1+a_1 a_2 \cdots \cdot a_n.$ Furthermore, let $$b_n = \frac{1}{a_1 } + \frac{1}{a_2 } +\cdots + \frac{1}{a_n }.$$ Prove that $b_n < \frac{2}{a_1}$ for all positive integers $n$ and that this is the smallest possible bound.

Let $f: \mathbb{R} \to \mathbb{R}$ be a non-decreasing function such that $f(y) - f(x) < y - x$ for all real numbers $x$ and $y > x$. The sequence $u_1,u_2,\ldots$ of real numbers is such that $u_{n+2} = f(u_{n+1}) - f(u_n)$ for all $n\geq 1$. Prove that for any $\varepsilon > 0$ there exists a positive integer $N$ such that $|u_n| < \varepsilon$ for all $n\geq N$.