Let $n\geq 2$ be a positive integer and let $a_1,a_2,...,a_n\in[0,1]$ be real numbers. Find the maximum value of the smallest of the numbers: \[a_1-a_1a_2, \ a_2-a_2a_3,...,a_n-a_na_1.\]

Find all the pairs of positive integers $(x,y)$ such that $x\leq y$ and \[\frac{(x+y)(xy-1)}{xy+1}=p,\]where $p$ is a prime number.

The incircle of triangle $ABC$ is tangent to the sides $AB,AC$ and $BC$ at the points $M,N$ and $K$ respectively. The median $AD$ of the triangle $ABC$ intersects $MN$ at the point $L$. Prove that $K,I$ and $L$ are collinear, where $I$ is the incenter of the triangle $ABC$.

Let $n\geq 2$ be a positive integer. On an $n\times n$ board, $n$ rooks are placed in such a manner that no two attack each other. All rooks move at the same time and are only allowed to move in a square adjacent to the one in which they are located. Determine all the values of $n$ for which there is a placement of the rooks so that, after a move, the rooks still do not attack each other. Note: Two squares are adjacent if they share a common side.

Let $I$ be the incenter of triangle $ABC$. The circle of centre $A$ and radius $AI$ intersects the circumcircle of triangle $ABC$ in $M$ and $N$. Prove that the line $MN$ is tangent to the incircle of triangle $ABC$

On a board, Ana and Bob start writing $0$s and $1$s alternatively until each of them has written $2021$ digits. Ana starts this procedure and each of them always adds a digit to the right of the already existing ones. Ana wins the game if, after they stop writing, the resulting number (in binary) can be written as the sum of two squares. Otherwise, Bob wins. Determine who has a winning strategy.

For any non-empty subset $X$ of $M=\{1,2,3,...,2021\}$, let $a_X$ be the sum of the greatest and smallest elements of $X$. Determine the arithmetic mean of all the values of $a_X$, as $X$ covers all the non-empty subsets of $M$.

Let $ABCD$ be a convex quadrilateral with angles $\sphericalangle A, \sphericalangle C\geq90^{\circ}$. On sides $AB,BC,CD$ and $DA$, consider the points $K,L,M$ and $N$ respectively. Prove that the perimeter of $KLMN$ is greater than or equal to $2\cdot AC$.

Let $n\geq 2$ be a positive integer. Prove that there exists a positive integer $m$, such that $n\mid m, \ m<n^4$ and at most four distinct digits are used in the decimal representation of $m$.

Let $a,b,c>0$ be real numbers with the property that $a+b+c=1$. Prove that \[\frac{1}{a+bc}+\frac{1}{b+ca}+\frac{1}{c+ab}\geq\frac{7}{1+abc}.\]

Let $O$ be the circumcenter of triangle $ABC$ and let $AD$ be the height from $A$ ($D\in BC$). Let $M,N,P$ and $Q$ be the midpoints of $AB,AC,BD$ and $CD$ respectively. Let $\mathcal{C}_1$ and $\mathcal{C}_2$ be the circumcircles of triangles $AMN$ and $POQ$. Prove that $\mathcal{C}_1\cap \mathcal{C}_2\cap AD\neq \emptyset$.

Let $p,q$ be positive integers. For any $a,b\in\mathbb{R}$ define the sets $$P(a)=\bigg\{a_n=a \ + \ n \ \cdot \ \frac{1}{p} : n\in\mathbb{N}\bigg\}\text{ and }Q(b)=\bigg\{b_n=b \ + \ n \ \cdot \ \frac{1}{q} : n\in\mathbb{N}\bigg\}.$$The distance between $P(a)$ and $Q(b)$ is the minimum value of $|x-y|$ as $x\in P(a), y\in Q(b)$. Find the maximum value of the distance between $P(a)$ and $Q(b)$ as $a,b\in\mathbb{R}$.

Let $M$ be a set of $13$ positive integers with the property that $\forall \ m\in M, \ 100\leq m\leq 999$. Prove that there exists a subset $S\subset M$ and a combination of arithmetic operations (addition, subtraction, multiplication, division – without using parentheses) between the elements of $S$, such that the value of the resulting expression is a rational number in the interval $(3,4)$.