Let $m$ be a positive integer. Define the sequence $\{a_{n}\}_{n \ge 0}$ by \[a_{0}=0, \; a_{1}=m, \; a_{n+1}=m^{2}a_{n}-a_{n-1}.\] Prove that an ordered pair $(a, b)$ of non-negative integers, with $a \le b$, gives a solution to the equation \[\frac{a^{2}+b^{2}}{ab+1}= m^{2}\] if and only if $(a, b)$ is of the form $(a_{n}, a_{n+1})$ for some $n \ge 0$.

Given an odd integer $n \geq 3$. Let $V$ be the set of vertices of a regular $n$-gon, and $P$ be the set of all regular polygons formed by points in $V$. For instance, when $n=15$, $P$ consists of $1$ regular $15$-gon, $3$ regular pentagons, and $5$ regular triangles. Initially, all points in $V$ are uncolored. Two players, $A$ and $B$, play a game where they take turns coloring an uncolored point, with player $A$ starting and coloring points red, and player $B$ coloring points blue. The game ends when all points are colored. A regular polygon in $P$ is called $\textit{good}$ if it has more red points than blue points. Find the largest positive integer $k$ such that no matter how player $B$ plays, player $A$ can ensure that there are at least $k$ $\textit{good}$ polygons.

A sequence $(a_n)$ of positive integers is defined by $a_0=m$ and $a_{n+1}= a_n^5 +487$ for all $n\ge 0$. Find all positive integers $m$ such that the sequence contains the maximum possible number of perfect squares.

Determine all real solutions of the following system of equations: $$x+y^2=y^3$$ $$y+x^2=x^3$$

Let triangle $ABC$ be perpendicular at $A.$ Let $M$ be the midpoint of segment $\overline{BC}.$ Point $D$ lies on side $\overline{AC}$ and satisfies $|AD|=|AM|.$ Let $P \neq C$ be the intersection of the circumcircle of triangles $AMC$ and $BDC.$ Prove that $CP$ bisects the angle at $C$ of triangle $ABC.$

A regular 2021-gon is divided into 2019 triangles,such that no diagonals intersect. Prove that at least 3 of the 2019 triangles are isoscoles

In an $n\times n$ array all the fields are colored with a different color. In one move one can choose a row, move all the fields one place to the right, and move the last field (from the right) to the leftmost field of the row; or one can choose a column, move all the fields one place downwards, and move the field at the bottom of the column to the top field of the same column. For what values of $n$ is it possible to reach any arrangement of the $n^2$ fields using these kinds of steps? [i]Proposed by Ádám Schweitzer[/i]

Show that for any positive integer $n$, \[\frac{\sigma(n!)}{n!}\ge \sum_{k=1}^{n}\frac{1}{k}.\]

There are $m$ pieces of candy held in $n$ trays($n,m\ge 4$). An [i]operation[/i] is defined as follow: take out one piece of candy from any two trays respectively, then put them in a third tray. Determine, with proof, if we can move all candies to a single tray by finite [i]operations[/i].

(a) Find all pairs $(m, n)$ of integers satisfying $m^3-4mn^2=8n^3-2m^2n$ (b) Among such pairs find those for which $m+n^2=3$

To prepare for an Olympiad $20$ students went to a coach. The coach gave them $20$ problems and it turned out that (a) each of the students solved two problems and (b) each problem was solved by twostudents. Prove that it is possible to organize the coaching so that each student would discuss one of the problems that (s)he had solved, and so that all problems would be discussed.

Let $S$ be the set of all permutations of $\{1, 2, 3, 4, 5\}$. For $s = (a_1, a_2,a_3,a_4,a_5) \in S$, define $\text{nimo}(s)$ to be the sum of all indices $i \in \{1, 2, 3, 4\}$ for which $a_i > a_{i+1}$. For instance, if $s=(2,3,1,5,4)$, then $\text{nimo}(s)=2+4=6$. Compute \[\sum_{s\in S}2^{\text{nimo}(s)}.\] [i]Proposed by Mehtaab Sawhney[/i]

For $ a>1$, find $ \lim_{n\to\infty} \int_0^a \frac{e^x}{1\plus{}x^n}dx.$

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $ x_1,x_2,\ldots,x_n$ be real numbers greater than 1. Show that \[ \frac{x_1x_2}{x_3}\plus{}\frac{x_2x_3}{x_4}\plus{}\cdots\plus{}\frac{x_nx_1}{x_2}\ge4n\] and determine when the equality holds.

a) Prove that we can assign one of the numbers $1$ or $-1$ to the vertices of a cube such that the product of the numbers assigned to the vertices of any face is equal to $-1$. b) Prove that for a hexagonal prism such a mapping is not possible.