A line $l$ passes through the center $O$ of an equilateral triangle $\Delta ABC$, which intersects $CA$ in $N$ and $BC$ in $M$. Prove that we can construct a triangle with $AM$,$BN$, and $MN$ such that the altitude to $MN$ (in this triangle) is constant when $l$ changes.

A rectangle is divided into $n^2$ smaller rectangle by $n - 1$ horizontal lines and $n - 1$ vertical lines. Between those rectangles there are exactly $5660$ which are not congruent. For what minimum value of $n$ is this possible?

[color=darkred]The altitude $[BH]$ dropped onto the hypotenuse of a triangle $ABC$ intersects the bisectors $[AD]$ and $[CE]$ at $Q$ and $P$ respectively. Prove that the line passing through the midpoints of the segments $[QD]$ and $[PE]$ is parallel to the line $AC$ .[/color]

Let $n$ be an integer with $n\ge 3$. Consider all dissections of a convex $n$-gon into triangles by $n-3$ non-intersecting diagonals, and all colourings of the triangles with black and white so that triangles with a common side are always of a different colour. Find the least possible number of black triangles.

Given triangle $ ABC$ and $ AB\equal{}c$, $ AC\equal{}b$ and $ BC\equal{}a$ satisfying $ a \geq b \geq c$, $ BE$ and $ CF$ are two interior angle bisectors. $ P$ is a point inside triangle $ AEF$. $ R$ and $ Q$ are the projections of $ P$ on sides $ AB$ and $ AC$. Prove that $ PR \plus{} PQ \plus{} RQ < b$.

Find the minimum positive value of $ 1*2*3*4*...*2020*2021*2022$ where you can replace $*$ as $+$ or $-$

Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] [*]$m > 1$ and $\gcd(m,n) = 1$; [*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ are not divisible by $n$; and [*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc. [i]Carl Schildkraut[/i]

The mass of metal deposited by the electrolysis of an aqueous solution of metal ions increases in direct proportion to which property? $\text{I. electrolysis current}$ $\text{II. electrolysis time}$ $\text{III. metal ion charge}$ $ \textbf{(A)}\ \text{I only} \qquad\textbf{(B)}\ \text{III only} \qquad\textbf{(C)}\ \text{I and II only} \qquad\textbf{(D)}\ \text{I, II, and III}\qquad$

Solve the equation $\sqrt{x^2 - 4x + 13} + 1 = 2x$

a) Is it possible to place $2024$ checkers on a board $70 \times 70$ so that any square $2 \times 2$ contains even number of checkers? b) Is it possible to place $2023$ checkers on a board $70 \times 70$ so that any square $2 \times 2$ contains odd number of checkers?

Let $ABC$ be an isosceles triangle with $\angle A = 90^{\circ}$. Points $D$ and $E$ are selected on sides $AB$ and $AC$, and points $X$ and $Y$ are the feet of the altitudes from $D$ and $E$ to side $BC$. Given that $AD = 48\sqrt2$ and $AE = 52\sqrt2$, compute $XY$. [i]Proposed by Evan Chen[/i]

Let $n$ be some positive integer and $a_1 , a_2 , \dots , a_n$ be real numbers. Denote $$S_0 = \sum_{i=1}^{n} a_i^2 , \hspace{1cm} S_1 = \sum_{i=1}^{n} a_ia_{i+1} , \hspace{1cm} S_2 = \sum_{i=1}^{n} a_ia_{i+2},$$ where $a_{n+1} = a_1$ and $a_{n+2} = a_2.$ 1. Show that $S_0 - S_1 \geq 0$. 2. Show that $3$ is the minimum value of $C$ such that for any $n$ and $a_1 , a_2 , \dots , a_n,$ there holds $C(S_0 - S_1) \geq S_1 - S_2$.

Positive integers $a, b,$ and $c$ have the property that $\text{lcm}(a,b), \text{lcm}(b,c),$ and $\text{lcm}(c,a)$ end in $4, 6,$ and $7,$ respectively, when written in base $10.$ Compute the minimum possible value of $a + b + c.$

Let $p$, $q$, and $r$ be the three roots of the polynomial $x^3 -2x^2 + 3x - 2023$. Suppose that the polynomial $x^3 + Bx^2 +Mx + T$ has roots $p + q$, $p + r$, and $q + r$ for real numbers $B$, $M$, and $T$. Compute $B -M + T$.

For every triangle $ ABC$, let $ D,E,F$ be a point located on segment $ BC,CA,AB$, respectively. Let $ P$ be the intersection of $ AD$ and $ EF$. Prove that: \[ \frac{AB}{AF}\times DC\plus{}\frac{AC}{AE}\times DB\equal{}\frac{AD}{AP}\times BC\]

Let $ABC$ be a triangle (right in $B$) inscribed in a semi-circumference of diameter $AC=10$. Determine the distance of the vertice $B$ to the side $AC$ if the median corresponding to the hypotenuse is the geometric mean of the sides of the triangle.

Let $n\ge 3$ be an integer. In a game there are $n$ boxes in a circular array. At the beginning, each box contains an object which can be rock, paper or scissors, in such a way that there are no two adjacent boxes with the same object, and each object appears in at least one box. Same as in the game, rock beats scissors, scissors beat paper, and paper beats rock. The game consists on moving objects from one box to another according to the following rule: [i]Two adjacent boxes and one object from each one are chosen in such a way that these are different, and we move the loser object to the box containing the winner object. For example, if we picked rock from box A and scissors from box B, we move scossors to box A.[/i] Prove that, applying the rule enough times, it is possible to move all the objects to the same box. [i]Proposed by Victor de la Fuente[/i]

Evaluate the sum of all three digits number which are not divisible by $13$ .

Let $\omega$ be a circle of radius $6$ with center $O$. Let $AB$ be a chord of $\omega$ having length $5$. For any real constant $c$, consider the locus $\mathcal{L}(c) $ of all points $P$ such that $PA^2 - PB^2 = c$. Find the largest value of $c$ for which the intersection of $\mathcal{L}(c)$ and $\omega$ consists of just one point.

Let $n \ge 2$ be a positive integer. An $n\times n$ grid of squares has been colored as a chessboard. Let a [i]move[/i] consist of picking a square from the board and then changing the colors to the opposite for all squares that lie in the same row as the chosen square, as well as for all squares that lie in the same column (the chosen square itself is also changed to the opposite color). Find all values of $n$ for which it is possible to make all squares of the grid be the same color in a finite sequence of moves.

Let $A$ be an $n\times n$ square matrix with integer entries. Suppose that $p^2A^{p^2}=q^2A^{q^2}+r^2I_n$ for some positive integers $p,q,r$ where $r$ is odd and $p^2=q^2+r^2$. Prove that $|\det A|=1$. (Here $I_n$ means the $n\times n$ identity matrix.)

If $a$ and $b$ are positive real numbers with sum $3$, and $x, y, z$ positive real numbers with product $1$, prove that : $(ax+b)(ay+b)(az+b)\geq 27$

A cube of edge length $s>0$ has the property that its surface area is equal to the sum of its volume and five times its edge length. Compute all possible values of $s$.

Albatross and Frankinfueter are playing again: each of them takes turns choosing one point in the plane with integer coordinates and paint it in his favorite color. Albatross plays first. Someone wins as soon as there is a square with all four corners in the are colored in their own color. Does anyone has a winning strategy and if so, who?

There is convex $n-$gon. We color all its sides and also diagonals, that goes out from one vertex. So we have $2n-3$ colored segments. We write positive numbers on colored segments. In one move we can take quadrilateral $ABCD$ such, that $AC$ and all sides are colored, then remove $AC$ and color $BD$ with number $\frac{xz+yt}{w}$, where $x,y,z,t,w$ - numbers on $AB,BC,CD,DA,AC$. After some moves we found that all colored segments are same that was at beginning. Prove, that they have same number that was at beginning.