In a sequence $P_n$ of quadratic trinomials each trinomial, starting with the third, is the sum of the two preceding trinomials. The first two trinomials do not have common roots. Is it possible that $P_n$ has an integral root for each $n$?

Show that there exists a sequence of positive integers $x_1, x_2,…x_n,…$ that satisfies the following two conditions: (i) Every positive integer appears exactly once, (ii) For every $n=1,2,…$ the partial sum $x_1+x_2+…+x_n$ is divisible by $n^n$.

Show that $e=\sum^{\infty}_{n=0} \frac{1}{n!}$ is irrational.

Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let \[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \] Prove that \[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \] where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?

Prove that there exist infinitely many positive integers $ n$ such that $ p \equal{} nr,$ where $ p$ and $ r$ are respectively the semiperimeter and the inradius of a triangle with integer side lengths.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Consider a set of $1001$ points in the plane, no three collinear. Compute the minimum number of segments that must be drawn so that among any four points, we can find a triangle. [i]Proposed by Ahaan S. Rungta / Amir Hossein[/i]

Let $a_0=5/2$ and $a_k=a_{k-1}^2-2$ for $k\ge 1.$ Compute \[\prod_{k=0}^{\infty}\left(1-\frac1{a_k}\right)\] in closed form.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(f(x)+y)+xf(y)=f(xy+y)+f(x)$$ for reals $x, y$.

Let $n \ge 3$ be an odd integer. In a $2n \times 2n$ board, we colour $2(n-1)^2$ cells. What is the largest number of three-square corners that can surely be cut out of the uncoloured figure? [i]Proposed by G. Sharafetdinova[/i]

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that \[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\] Prove there exist positive integers $\ell \leq s$ and $N$, such that \[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\] [i]Proposed by Morteza Saghafiyan, Iran[/i]

A standard deck of $52$ cards is shuffled and randomly arranged in a queue, with each card having a suit $(\diamondsuit,\clubsuit,\heartsuit,\spadesuit)$ and a rank $(\text{Ace},2,3,4,5,6,7,8,9,10,\text{Jack},\text{Queen},\text{ King})$. For example, a card with the $\diamondsuit$ suit and the $7$ rank would be denoted as $\diamondsuit7$, and a card with the $\spadesuit$ and the $\text{Ace}$ rank would be denoted as $\spadesuit\text{Ace}$. In the queue, there exists a card with a rank of $\text{Ace}$ that appears for the first time in the queue. Let the card immediately following the above card be denoted as card $C$. Is the probability that $C$ is a $\spadesuit\text{A}$ higher than, equal to, or lower than the probability that $C$ is a $\clubsuit2$?

Find all functions $f: \mathbb{Q^+} \rightarrow \mathbb{Q}$ satisfying $f(x)+f(y)= \left(f(x+y)+\frac{1}{x+y} \right) (1-xy+f(xy))$ for all $x, y \in \mathbb{Q^+}$.

Let $k$ be a positive integer. For each nonnegative integer $n$, let $f(n)$ be the number of solutions $(x_1,\ldots,x_k)\in\mathbb{Z}^k$ of the inequality $|x_1|+...+|x_k|\leq n$. Prove that for every $n\ge1$, we have $f(n-1)f(n+1)\leq f(n)^2$. (Proposed by Esteban Arreaga, Renan Finder and José Madrid, IMPA, Rio de Janeiro)