Find all integer $n$ such that the equation $2x^2 + 5xy + 2y^2 = n$ has integer solution for $x$ and $y$.

Let $ABC$ be an acute triangle, where $AB$ is the smallest side and let $D$ be the midpoint of $AB$. Let $P$ be a point in the interior of the triangle $ABC$ such that $\angle CAP = \angle CBP = \angle ACB$. From the point $P$, we draw perpendicular lines on $BC$ and $AC$ where the intersection point with $BC$ is $M$, and with $AC$ is $N$ . Through the point $M$ we draw a line parallel to $AC$, and through $N$ parallel to $BC$. These lines intercept at the point $K$. Prove that $D$ is the center of the circumscribed circle for the triangle $MNK$.

For every positive integer $n$, $s(n)$ denotes the sum of the digits in the decimal representation of $n$. Prove that for every integer $n \ge 5$, we have $$S(1)S(3)...S(2n-1) \ge S(2)S(4)...S(2n)$$

Let $P$ is a regular $(2n+1)$-gon in the plane, where $n$ is a positive integer. We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $\overline{ES}$ contains no other points that lie on the sides of $P$ except $S$ . We want to color the sides of $P$ in $3$ colors, such that every side is colored in exactly one color, and each color must be used at least once. Moreover, from every point in the plane external to $P$ , at most $2$ different colors on $P$ can be seen (ignore the vertices of $P$ , we consider them colorless). Find the largest positive integer $n$ for which such a coloring is possible.

Let $N$ is the set of all positive integers. Determine all mappings $f: N-\{1\} \to N$ such that for every $n \ne m$ the following equation is true $$f(n)f(m)=f\left((nm)^{2021}\right)$$

The altitudes $BB_1$ and $CC_1$, are drawn in an acute triangle $ABC$. Let $X$ and $Y$ be the points, which are symmetrical to the points $B_1$ and $C_1$, with respect to the midpoints of the sides$ AB$ and $AC$ of the triangle $ABC$ respectively. Let's denote with $Z$ the point of intersection of the lines $BC$ and $XY$. Prove that the line $ZA$ is tangent to the circumscribed circle of the triangle $AXY$ .

For a positive integer $n$ we define $f (n) = \max X_1^{X_2^{...^{X_k}}}$ where the maximum is taken over all possible decompositions of natural numbers $n = X_1X_2...X_k$. Determine $f(n)$.

A number of $n$ lamps ($n\ge 3$) are put at $n$ vertices of a regular $n$-gon. Initially, all the lamps are off. In each step. Lisa will choose three lamps that are located at three vertices of an isosceles triangle and change their states (from off to on and vice versa). Her aim is to turn on all the lamps. At least how many steps are required to do so?