Consider an arbitrary equilateral triangle $KLM$, whose vertices $K, L$ and $M$ lie on the sides $AB, BC$ and $CD$, respectively, of a given square $ABCD$. Find the locus of the midpoints of the sides $KL$ of all such triangles $KLM$.

There are $n$ coins lying in a circle. Each coin has two sides, $+$ and $-$. A $flop$ means to flip every coin that has two different neighbors simultaneously, while leaving the others alone. For instance, $++-+$, after one $flop$, becomes $+---$. For $n$ coins, let us define $M$ to be a $perfect$ $number$ if for any initial arrangement of the coins, the arrangement of the coins after $m$ $flops$ is exactly the same as the initial one. (a) When $n=1024$, find a perfect number $M$. (b) Find all $n$ for which a perfect number $M$ exist.

Consider the recurrence relation $$a_{n+3}=\frac{a_{n+2}a_{n+1}-2}{a_n}$$ with initial condition $(a_0,a_1,a_2)=(1,2,5)$. Let $b_n=a_{2n}$ for nonnegative integral $n$. It turns out that $b_{n+2}+xb_{n+1}+yb_n=0$ for some pair of real numbers $(x,y)$. Compute $(x,y)$.

Let triangle $ABC$ be such that its circumradius is $R = 1.$ Let $r$ be the inradius of $ABC$ and let $p$ be the inradius of the orthic triangle $A'B'C'$ of triangle $ABC.$ Prove that \[ p \leq 1 - \frac{1}{3 \cdot (1+r)^2}. \] [hide="Similar Problem posted by Pascual2005"] Let $ABC$ be a triangle with circumradius $R$ and inradius $r$. If $p$ is the inradius of the orthic triangle of triangle $ABC$, show that $\frac{p}{R} \leq 1 - \frac{\left(1+\frac{r}{R}\right)^2}{3}$. [i]Note.[/i] The orthic triangle of triangle $ABC$ is defined as the triangle whose vertices are the feet of the altitudes of triangle $ABC$. [b]SOLUTION 1 by mecrazywong:[/b] $p=2R\cos A\cos B\cos C,1+\frac{r}{R}=1+4\sin A/2\sin B/2\sin C/2=\cos A+\cos B+\cos C$. Thus, the ineqaulity is equivalent to $6\cos A\cos B\cos C+(\cos A+\cos B+\cos C)^2\le3$. But this is easy since $\cos A+\cos B+\cos C\le3/2,\cos A\cos B\cos C\le1/8$. [b]SOLUTION 2 by Virgil Nicula:[/b] I note the inradius $r'$ of a orthic triangle. Must prove the inequality $\frac{r'}{R}\le 1-\frac 13\left( 1+\frac rR\right)^2.$ From the wellknown relations $r'=2R\cos A\cos B\cos C$ and $\cos A\cos B\cos C\le \frac 18$ results $\frac{r'}{R}\le \frac 14.$ But $\frac 14\le 1-\frac 13\left( 1+\frac rR\right)^2\Longleftrightarrow \frac 13\left( 1+\frac rR\right)^2\le \frac 34\Longleftrightarrow$ $\left(1+\frac rR\right)^2\le \left(\frac 32\right)^2\Longleftrightarrow 1+\frac rR\le \frac 32\Longleftrightarrow \frac rR\le \frac 12\Longleftrightarrow 2r\le R$ (true). Therefore, $\frac{r'}{R}\le \frac 14\le 1-\frac 13\left( 1+\frac rR\right)^2\Longrightarrow \frac{r'}{R}\le 1-\frac 13\left( 1+\frac rR\right)^2.$ [b]SOLUTION 3 by darij grinberg:[/b] I know this is not quite an ML reference, but the problem was discussed in Hyacinthos messages #6951, #6978, #6981, #6982, #6985, #6986 (particularly the last message). [/hide]

Find all functions $f : R \to R$ such that the inequality $$\sum_{i=1}^{2549} f(x_i + x_{i+1}) + f (\sum_{i=1}^{2550}x_y) \le \sum_{i=1}^{2550}f(2x_i)$$ for all reals $x_1, x_2, . . . , x_{2550}$.

Let a function $f$ satisfy $f(1) = 1$ and $f(1)+ f(2)+...+ f(n) = n^2f(n)$ for all $n \in N$. Determine $f(1995)$.

Let $a,b,c\in\mathbb R_+$ satisfy that $$\sqrt{(1+a)(1+b)(1+c)}=\sqrt{(ab-a-b+1)(1+c)}+\sqrt{(bc-b-c+1)(1+a)}+\sqrt{(ca-c-a+1)(1+b)}.$$ Find the value range of $a+b+c.$

The circle $ \omega $ inscribed in triangle $ABC$ touches its sides $AB, BC, CA$ at points $K, L, M$ respectively. In the arc $KL$ of the circle $ \omega $ that does not contain the point $M$, we select point $S$. Denote by $P, Q, R, T$ the intersection points of straight $AS$ and $KM, ML$ and $SC, LP$ and $KQ, AQ$ and $PC$ respectively. It turned out that the points $R, S$ and $M$ are collinear. Prove that the point $T$ also lies on the line $SM$.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

Given an acute triangle $ABC$, let $P$ be an arbitrary point on segment $BC$. A line passing through $P$ and perpendicular to $AC$ intersects $AB$ at $P_b$. A line passing through $P$ and perpendicular to $AB$ intersects $AC$ at $P_c$. Prove that the circumcircle of triangle $AP_bP_c$ passes through a fixed point other than $A$ when $P$ varies on segment $BC$. [i]Proposed by ltf0501[/i]

Let $ABC$ be a triangle with circumcircle $\Gamma$ and circumcentre $O$. Denote by $M$ the midpoint of $BC$. The point $D$ is the reflection of $A$ over $BC$, and the point $E$ is the intersection of $\Gamma$ and the ray $MD$. Let $S$ be the circumcentre of the triangle $ADE$. Prove that the points $A$, $E$, $M$, $O$, and $S$ lie on the same circle.

Let us have a line $\ell$ in the space and a point $A$ not lying on $\ell.$ For an arbitrary line $\ell'$ passing through $A$, $XY$ ($Y$ is on $\ell'$) is a common perpendicular to the lines $\ell$ and $\ell'.$ Find the locus of points $Y.$

In $\triangle ABC$, $AB = 40$, $BC = 60$, and $CA = 50$. The angle bisector of $\angle A$ intersects the circumcircle of $\triangle ABC$ at $A$ and $P$. Find $BP$. [i]Proposed by Eugene Chen[/i]

Let $f : R^+ \to R^+$ be a function such that for all $x, y \in R^+$, $f(x)f(y) = f(xy) + f\left( \frac{x}{y}\right)$, where $R^+$ represents the positive real numbers. Given that $f(2) = 3$, compute the last two digits of $f(2^{2^{2020}})$. .

In the plane a point $O$ is and a sequence of points $P_1, P_2, P_3, \ldots$ are given. The distances $OP_1, OP_2, OP_3, \ldots$ are $r_1, r_2, r_3, \ldots$ Let $\alpha$ satisfies $0 < \alpha < 1.$ Suppose that for every $n$ the distance from the point $P_n$ to any other point of the sequence is $\geq r^{\alpha}_n.$ Determine the exponent $\beta$, as large as possible such that for some $C$ independent of $n$ \[r_n \geq Cn^{\beta}, n = 1,2, \ldots\]

Quadrilateral $ABCD$ has the property that $AD = BD = CD$ and $\angle ADB < \angle CDB$. Let the circumcircle of $ABD$ be $O$. $O$ intersects $BC$ at $E$ and $CD$ at $F$. Next, extend $AB$ and $CD$ to intersect at a point $G$. Suppose that $BE = 1$, $EF = 3$, and $F D = 4$. Compute the perimeter of $\vartriangle ADG$.

Given a natural number $n\ge 3$, determine all strictly increasing sequences $a_1<a_2<\cdots<a_n$ such that $\text{gcd}(a_1,a_2)=1$ and for any pair of natural numbers $(k,m)$ satisfy $n\ge m\ge 3$, $m\ge k$, $$\frac{a_1+a_2+\cdots +a_m}{a_k}$$ is a positive integer.

Find all ordered pairs of positive integers $(m,n)$ for which there exists a set $C=\{c_1,\ldots,c_k\}$ ($k\ge1$) of colors and an assignment of colors to each of the $mn$ unit squares of a $m\times n$ grid such that for every color $c_i\in C$ and unit square $S$ of color $c_i$, exactly two direct (non-diagonal) neighbors of $S$ have color $c_i$. [i]David Yang.[/i]

It is known that the distances from all the vertices of a cube and the centers of its faces to a certain plane ($14$ values in total) take two different values. The smallest is $1$. What can the edge of a cube be equal to?

Prove the trigonometric inequality $\cos x < 1 - \frac{x^2}{2} + \frac{x^4}{16},$ when $x \in \left(0, \frac{\pi}{2} \right).$

Consider the system of equations $$a + 2b + 3c + \ldots + 26z = 2020$$ $$b + 2c + 3d + \ldots + 26a = 2019$$ $$\vdots$$ $$y + 2z + 3a + \ldots + 26x = 1996$$ $$z + 2a + 3b + \ldots + 26y = 1995$$ where each equation is a rearrangement of the first equation with the variables cycling and the coefficients staying in place. Find the value of $$z + 2y + 3x + \dots + 26a.$$ [i]Proposed by Joshua Hsieh[/i]

Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$. If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.

Let $ABCDEFGH$ be a cube. Consider a plane whose intersection with the tetrahedron $ABDE$ is a triangle with an obtuse angle $\varphi.$ Determine all $\varphi>\pi/2$ for which there is such a plane.

Determine all pairs of integers $a, b$ for which they apply $4^a + 4a^2 + 4 = b^2$ .

Let $$P(x)=1+2 x+7 x^{2}+13 x^{3}~,\qquad x \in \mathbb{R} .$$ Calculate for all $x \in \mathbb{R},$ $$\lim _{n \rightarrow \infty}\left(P\left(\frac{x}{n}\right)\right)^{n}$$