There is a board with the shape of an equilateral triangle with side $n$ divided into triangular cells with the shape of equilateral triangles with side $ 1$ (the figure below shows the board when $n = 4$). Each and every triangular cell is colored either red or blue. What is the least number of cells that can be colored blue without two red cells sharing one side?

Let $a$, $b$ and $c$ be positive real numbers, prove that \[\frac{2a^2 b^2}{a^5+b^5}+\frac{2b^2 c^2}{b^5+c^5}+\frac{2c^2 a^2}{c^5+a^5}\le\frac{a+b}{2ab}+\frac{b+c}{2bc}+\frac{c+a}{2ca}\]

In an acute triangle $ABC$, an arbitrary point $P$ is chosen on the altitude $AH$. The points $E$ and $F$ are the midpoints of $AC$ and $AB$, respectively. The perpendiculars from $E$ on $CP$ and from $F$ on $BP$ intersect at the point $K$. Show that $KB = KC$.

Let $\Gamma_1$ be a circle with center $O$ and $A$ a point on it. Consider the circle $\Gamma_2$ with center at $A$ and radius $AO$. Let $P$ and $Q$ be the intersection points of $\Gamma_1$and $\Gamma_2$. Consider the circle $\Gamma_3$ with center at $P$ and radius $PQ$. Let $C$ be the second intersection point of $\Gamma_3$ and $\Gamma_1$. The line $OP$ cuts $\Gamma_3$ at $R$ and $S$, with $R$ outside $\Gamma_1$. $RC$ cuts $\Gamma_1$ into $B$. $CS$ cuts $\Gamma_1$ into $D$. Show that $ABCD$ is a square.

Find all positive integers $m,n$ such that $m^2+5n$ and $n^2+5m$ are perfect squares.

Let $n,k$ be integers such that $n\geq k\geq3$. Consider $n+1$ points in a plane (there is no three collinear points) and $k$ different colors, then, we color all the segments that connect every two points. We say that an angle is good if its vertex is one of the initial set, and its two sides aren't the same color. Show that there exist a coloration such that the total number of good angles is greater than $n \binom{k}{2} \lfloor(\frac{n}{k})\rfloor^2$