Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$

Let \(a_0, a_1, a_2, \dots\) be an infinite sequence of positive integers with the following properties: - \(a_0\) is a given positive integer; - For each integer \(n \geq 1\), \(a_n\) is the smallest integer greater than \(a_{n-1}\) such that \(a_n + a_{n-1}\) is a perfect square. For example, if \(a_0 = 3\), then \(a_1 = 6\), \(a_2 = 10\), \(a_3 = 15\), and so on. (a) Let \(T\) be the set of numbers of the form \(a_k - a_l\), with \(k \geq l \geq 0\) integers. Prove that, regardless of the value of \(a_0\), the number of positive integers not in \(T\) is finite. (b) Calculate, as a function of \(a_0\), the number of positive integers that are not in \(T\).

Determine whether there exists an infinite sequence $a_1, a_2, a_3, \dots$ of positive integers which satisfies the equality \[a_{n+2}=a_{n+1}+\sqrt{a_{n+1}+a_{n}} \] for every positive integer $n$.

Let $$x_0 = 5\,\, ,\, \,\,x_{n+1} = x_n +\frac{1}{x_n}.$$ Prove that $45 < x_{1000} < 45.1$.

Suppose there are $n\geq{5}$ different points arbitrarily arranged on a circle, the labels are $1, 2,\dots $, and $n$, and the permutation is $S$. For a permutation , a “descending chain” refers to several consecutive points on the circle , and its labels is a clockwise descending sequence (the length of sequence is at least $2$), and the descending chain cannot be extended to longer .The point with the largest label in the chain is called the "starting point of descent", and the other points in the chain are called the “non-starting point of descent” . For example: there are two descending chains $5, 2$and $4, 1$ in $5, 2, 4, 1, 3$ arranged in a clockwise direction, and $5$ and $4$ are their starting points of descent respectively, and $2, 1$ is the non-starting point of descent . Consider the following operations: in the first round, find all descending chains in the permutation $S$, delete all non-starting points of descent , and then repeat the first round of operations for the arrangement of the remaining points, until no more descending chains can be found. Let $G(S)$ be the number of all descending chains that permutation $S$ has appeared in the operations, $A(S)$ be the average value of $G(S)$of all possible n-point permutations $S$. (1) Find $A(5)$. (2)For $n\ge{6}$ , prove that $\frac{83}{120}n-\frac{1}{2} \le A(S) \le \frac{101}{120}n-\frac{1}{2}.$

Alice and Bob play a game. Bob starts by picking a set $S$ consisting of $M$ vectors of length $n$ with entries either $0$ or $1$. Alice picks a sequence of numbers $y_1\le y_2\le\dots\le y_n$ from the interval $[0,1]$, and a choice of real numbers $x_1,x_2\dots,x_n\in \mathbb{R}$. Bob wins if he can pick a vector $(z_1,z_2,\dots,z_n)\in S$ such that $$\sum_{i=1}^n x_iy_i\le \sum_{i=1}^n x_iz_i,$$otherwise Alice wins. Determine the minimum value of $M$ so that Bob can guarantee a win. [i]Proposed by DVDthe1st[/i]

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

For every non-negative integer $n$ , let $s_n$ be the sum of digits in the decimal expansion of $2^n$. Is the sequence $(s_n)_{n \in \mathbb{N}}$ eventually increasing ?

Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios Proposed by [i]Morteza Saghafian[/i]

For the real numbers $a_1,...,a_n, b_1,...,b_m$ , the following relations hold: 1) $|a_i|= |b_j|=1$, $i=1,...,n$ ,$j=1,...,m$ 2) $a_1\sqrt{2+a_2\sqrt{2+...+a_n\sqrt2}}=b_1\sqrt{2+b_2\sqrt{2+...+b_m\sqrt2}}$ Prove that $n = m$ and $a_i=b_i$ , $i=1,...,n$

Find all functions $f:(0,\infty)\to(0,\infty)$ such that $$f(f(f(x)))+4f(f(x))+f(x)=6x.$$

Is there an infinite sequence of positive real numbers $x_1,x_2,...,x_n$ satisfying for all $n\ge 1$ the relation $x_{n+2}= \sqrt{x_{n+1}}-\sqrt{x_n}$?

The Fibonacci sequence is defined by $F_0=F_1=1$ and $F_{n+2}=F_{n+1}+F_n$ for $n\ge0$. Prove that the sum of $2000$ consecutive terms of the Fibonacci sequence is never a term of the sequence.

Do there exist a sequence $a_1, a_2, \ldots , a_n, \ldots$ of positive integers such that for any positive integers $i, j$: $$d(a_i + a_j ) = i + j?$$ Here $d(n)$ is the number of positive divisors of a positive integer

$\boxed{A5}$Let $n\in{N},n>2$,and suppose $a_1,a_2,...,a_{2n}$ is a permutation of the numbers $1,2,...,2n$ such that $a_1<a_3<...<a_{2n-1}$ and $a_2>a_4>...>a_{2n}.$Prove that \[(a_1-a_2)^2+(a_3-a_4)^2+...+(a_{2n-1}-a_{2n})^2>n^3\]

Let $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ be two sequences of positive numbers. Show that the following statements are equivalent: [list=1] [*]There is a sequence $(c_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}{\frac{a_n}{c_n}}$ and $\sum_{n=1}^{\infty}{\frac{c_n}{b_n}}$ both converge;[/*] [*]$\sum_{n=1}^{\infty}{\sqrt{\frac{a_n}{b_n}}}$ converges.[/*] [/list] [i]Proposed by Tomáš Bárta, Charles University, Prague[/i]

$w(x)$ is a polynomial with integer coefficients. Let $p_n$ be the sum of the digits of the number $w(n)$. Show that some value must occur infinitely often in the sequence $p_1, p_2, p_3, ...$ .

Let $u_k$, $v_k$, $a_k$ and $b_k$ be non-negative real sequences such as $u_k > a_k$ and $v_k > b_k$, where $k = 1, 2,\cdots , n$. If $0 < m_1 \leq u_k \leq M_1$ and $0 < m_2 \leq v_k \leq M_2$, then $$\sum \limits_{k=1}^n(lu_kv_k-a_kb_k)\geq \left(\sum \limits_{k=1}^n\left(u_k^2-a_k^2\right)\right)^\frac{1}{2}\left(\sum \limits_{k=1}^n\left(v_k^2-b_k^2\right)\right)^\frac{1}{2}$$where$$l=\frac{M_1M_2+m_1m_2}{2\sqrt{m_1M_1m_2M_2}}$$

Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by \[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), \] where $\lfloor x\rfloor$ denotes the integer part of $x$. [b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often. [b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often. [i]Proposed by Johan Meyer, South Africa[/i]

Let $a_1,a_2,a_3,\dots$ be a sequence of real numbers satisfying the inequality \[ |a_{k+m}-a_k-a_m| \leq 1 \quad \text{for all} \ k,m \in \mathbb{Z}_{>0}. \] Show that the following inequality holds for all positive integers $k,m$ \[ \left| \frac{a_k}{k}-\frac{a_m}{m} \right| < \frac{1}{k}+\frac{1}{m}. \]

Define a sequence $\langle f(n)\rangle^{\infty}_{n=1}$ of positive integers by $f(1) = 1$ and \[f(n) = \begin{cases} f(n-1) - n & \text{ if } f(n-1) > n;\\ f(n-1) + n & \text{ if } f(n-1) \leq n, \end{cases}\] for $n \geq 2.$ Let $S = \{n \in \mathbb{N} \;\mid\; f(n) = 1993\}.$ [b](i)[/b] Prove that $S$ is an infinite set. [b](ii)[/b] Find the least positive integer in $S.$ [b](iii)[/b] If all the elements of $S$ are written in ascending order as \[ n_1 < n_2 < n_3 < \ldots , \] show that \[ \lim_{i\rightarrow\infty} \frac{n_{i+1}}{n_i} = 3. \]

Let $\mathbb{N}_0$ denote the set of non-negative integers. Determine all non-negative integers $k$ for which there exists a function $f: \mathbb{N}_0 \to \mathbb{N}_0$ such that $f(2024) = k$ and $f(f(n)) \leq f(n+1) - f(n)$ for all non-negative integers $n$.

Determine if there exists an infinite sequence of positive integers $a_1,a_2, a_3, ...$ such that (i) each positive integer occurs exactly once in the sequence, and (ii) each positive integer occurs exactly once in the sequence $ |a_1 - a_2|, |a_2 - a_3|, ..., |a+k - a_{k+1}|, ...$