Given equilateral triangle with the side $l$. What is the minimal length $d$ of a brush (segment), that will paint all the triangle, if its ends are moving along the sides of the triangle.

[color=indigo]Let $ABC$ is an acute angled triangle and let $A_{1},\, B_{1},\, C_{1}$ are points respectively on $BC,\,CA,\,AB$ such that $\triangle ABC$ is similar to $\triangle A_{1}B_{1}C_{1}.$ Prove that orthocenter of $A_{1}B_{1}C_{1}$ coincides with circumcenter of $ABC$.[/color]

Lyuba, Tanya, Lena and Ira ran across a flat field. At some point it turned out that among the pairwise distances between them there are distances of $1, 2, 3, 4$ and $5$ meters, and there are no other distances. Give an example of how this could be.

Find the biggest real number $ k$ such that for each right-angled triangle with sides $ a$, $ b$, $ c$, we have \[ a^{3}\plus{}b^{3}\plus{}c^{3}\geq k\left(a\plus{}b\plus{}c\right)^{3}.\]

If the perimeter of rectangle $ABCD$ is $20$ inches, the least value of diagonal $\overline{AC}$, in inches, is: $\textbf{(A)}\ 0\qquad \textbf{(B)}\ \sqrt{50}\qquad \textbf{(C)}\ 10\qquad \textbf{(D)}\ \sqrt{200}\qquad \textbf{(E)}\ \text{none of these}$

A circle $\omega$ is inscribed in triangle $ABC$, tangent to the side $BC$ at point $K$. Circle $\omega'$ is symmetrical to the circle $\omega$ with respect to point $A$. The point $A_0$ is chosen so that the segments $BA_0$ and $CA_0$ touch $\omega'$. Let $M$ be the midpoint of side $BC$. Prove that the line $AM$ bisects the segment $KA_0$.

Does there exist a polynomial $P(x)$ with integer coefficients such that $P(1+\sqrt[3]{2})=1+\sqrt[3]{2}$ and $P(1+\sqrt5)=2+3\sqrt5$?

Line $\ell$ intersects sides $BC$ and $AD$ of cyclic quadrilateral $ABCD$ in its interior points $R$ and $S$, respectively, and intersects ray $DC$ beyond point $C$ at $Q$, and ray $BA$ beyond point $A$ at $P$. Circumcircles of the triangles $QCR$ and $QDS$ intersect at $N \neq Q$, while circumcircles of the triangles $PAS$ and $PBR$ intersect at $M\neq P$. Let lines $MP$ and $NQ$ meet at point $X$, lines $AB$ and $CD$ meet at point $K$ and lines $BC$ and $AD$ meet at point $L$. Prove that point $X$ lies on line $KL$.

Consider a $9 \times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9, inclusive. The grid is called a $\textit{super-sudoku}$ if each of the following three conditions hold: [list] [*] Each column in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once. [*] Each row in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once. [*] Each $3 \times 3$ subsquare in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once. [/list] How many possible super-sudoku grids are there?

The figure $ABCDEF$ is a regular hexagon. Find all points $M$ belonging to the hexagon such that Area of triangle $MAC =$ Area of triangle $MCD$.

In a triangle $T$, all the angles are less than $90^o$, and the longest side has length $s$. Show that for every point $p$ in $T$ we can pick a corner $h$ in $T$ such that the distance from $p$ to $h$ is less than or equal to $s/\sqrt3$.

Compute $\mathop {\lim }\limits_{n \to \infty } \left\{ {{{\left( {2 + \sqrt 3 } \right)}^n}} \right\}$

Find the sum of all integers $n$ for which $n - 3$ and $n^2 + 4$ are both perfect cubes.

We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by \[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), \] where $\lfloor x\rfloor$ denotes the integer part of $x$. [b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often. [b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often. [i]Proposed by Johan Meyer, South Africa[/i]

Find minimal value of $a \in \mathbb{R}$ such that system $$\sqrt{x-1}+\sqrt{y-1}+\sqrt{z-1}=a-1$$ $$\sqrt{x+1}+\sqrt{y+1}+\sqrt{z+1}=a+1$$ has solution in set of real numbers

If this path is to continue in the same pattern: [asy] unitsize(24); draw((0,0)--(1,0)--(1,1)--(2,1)--(2,0)--(3,0)--(3,1)--(4,1)--(4,0)--(5,0)--(5,1)--(6,1)); draw((2/3,1/5)--(1,0)--(2/3,-1/5)); draw((4/5,2/3)--(1,1)--(6/5,2/3)); draw((5/3,6/5)--(2,1)--(5/3,4/5)); draw((9/5,1/3)--(2,0)--(11/5,1/3)); draw((8/3,1/5)--(3,0)--(8/3,-1/5)); draw((14/5,2/3)--(3,1)--(16/5,2/3)); draw((11/3,6/5)--(4,1)--(11/3,4/5)); draw((19/5,1/3)--(4,0)--(21/5,1/3)); draw((14/3,1/5)--(5,0)--(14/3,-1/5)); draw((24/5,2/3)--(5,1)--(26/5,2/3)); draw((17/3,6/5)--(6,1)--(17/3,4/5)); dot((0,0)); dot((1,0)); dot((1,1)); dot((2,1)); dot((2,0)); dot((3,0)); dot((3,1)); dot((4,1)); dot((4,0)); dot((5,0)); dot((5,1)); label("$0$",(0,0),S); label("$1$",(1,0),S); label("$2$",(1,1),N); label("$3$",(2,1),N); label("$4$",(2,0),S); label("$5$",(3,0),S); label("$6$",(3,1),N); label("$7$",(4,1),N); label("$8$",(4,0),S); label("$9$",(5,0),S); label("$10$",(5,1),N); label("$\vdots$",(5.85,0.5),E); label("$\cdots$",(6.5,0.15),S); [/asy] then which sequence of arrows goes from point $425$ to point $427$? [asy] unitsize(24); dot((0,0)); dot((0,1)); dot((1,1)); draw((0,0)--(0,1)--(1,1)); draw((-1/5,2/3)--(0,1)--(1/5,2/3)); draw((2/3,6/5)--(1,1)--(2/3,4/5)); label("(A)",(-1/3,1/3),W); dot((4,0)); dot((5,0)); dot((5,1)); draw((4,0)--(5,0)--(5,1)); draw((14/3,1/5)--(5,0)--(14/3,-1/5)); draw((24/5,2/3)--(5,1)--(26/5,2/3)); label("(B)",(11/3,1/3),W); dot((8,1)); dot((8,0)); dot((9,0)); draw((8,1)--(8,0)--(9,0)); draw((39/5,1/3)--(8,0)--(41/5,1/3)); draw((26/3,1/5)--(9,0)--(26/3,-1/5)); label("(C)",(23/3,1/3),W); dot((12,1)); dot((13,1)); dot((13,0)); draw((12,1)--(13,1)--(13,0)); draw((38/3,6/5)--(13,1)--(38/3,4/5)); draw((64/5,1/3)--(13,0)--(66/5,1/3)); label("(D)",(35/3,1/3),W); dot((17,1)); dot((17,0)); dot((16,0)); draw((17,1)--(17,0)--(16,0)); draw((84/5,1/3)--(17,0)--(86/5,1/3)); draw((49/3,1/5)--(16,0)--(49/3,-1/5)); label("(E)",(47/3,1/3),W); [/asy]

In rectangular coordinate system, give two points $M(-1,2),N(1,4)$, $P$ is a moving point on $x$-axis, when $\angle MPN$ takes its maximum value, the $x$-axis of $P$ is________.

Define the sequence $(w_n)_{n\ge0}$ by the recurrence relation $$w_{n+2}=2w_{n+1}+3w_n,\enspace\enspace w_0=1,w_1=i,\enspace n=0,1,\ldots$$ (1) Find the general formula for $w_n$ and compute the first $9$ terms. (2) Show that $|\Re w_n-\Im w_n|=1$ for all $n\ge1$. [i]Proposed by Ovidiu Bagdasar[/i]

Determine the smallest value of $x^2 + y^2 + z^2$, where $x, y, z$ are real numbers, so that $x^3 + y^3 + z^3 -3xyz = 1.$

Let $f(x)$ be a polynomial of finite degree satisfying $$(x+9)f(x+1)=(x+3)f(x+3)$$ for all real $x$. If $f(0)=1$, find the value of $f(1)$.

Joe the teacher is bad at rounding. Because of this, he has come up with his own way to round grades, where a [i]grade[/i] is a nonnegative decimal number with finitely many digits after the decimal point. Given a grade with digits $a_1a_2 \dots a_m.b_1b_2 \dots b_n$, Joe first rounds the number to the nearest $10^{-n+1}$th place. He then repeats the procedure on the new number, rounding to the nearest $10^{-n+2}$th, then rounding the result to the nearest $10^{-n+3}$th, and so on, until he obtains an integer. For example, he rounds the number $2014.456$ via $2014.456 \to 2014.46 \to 2014.5 \to 2015$. There exists a rational number $M$ such that a grade $x$ gets rounded to at least $90$ if and only if $x \ge M$. If $M = \tfrac pq$ for relatively prime integers $p$ and $q$, compute $p+q$. [i]Proposed by Yang Liu[/i]

Five distinct points $A, B, C, D$ and $E$ lie in this order on a circle of radius $r$ and satisfy $AC = BD = CE = r$. Prove that the orthocentres of the triangles $ACD, BCD$ and $BCE$ are the vertices of a right-angled triangle.

Let $m$ and $n$ be integers greater than $2$, and let $A$ and $B$ be non-constant polynomials with complex coefficients, at least one of which has a degree greater than $1$. Prove that if the degree of the polynomial $A^m-B^n$ is less than $\min(m,n)$, then $A^m=B^n$. [i]Proposed by Tobi Moektijono, Indonesia[/i]

Given $a$, $b$ are positive integers greater than $1$, and for every positive integer $n$, $b^{n}-1$ divides $a^{n}-1$. Define the polynomial $p_{n}(x)$ as follows: $p_0{x}=-1$, $p_{n+1}(x)=b^{n+1}(x-1)p_{n}(bx)-a(b^{n+1}-1)p_{n}(x)$, for $n \ge 0$. Prove that there exist integers $C$ and positive integer $k$ such that $p_{k}(x)=Cx^k$.

Samuel Tsui and Jason Yang each chose a different integer between $1$ and $60$, inclusive. They don’t know each others’ numbers, but they both know that the other person’s number is between $1$ and $60$ and distinct from their own. They have the following conversation: Samuel Tsui: Do our numbers have any common factors greater than $1$? Jason Yang: Definitely not. However their least common multiple must be less than$ 2023$. Samuel Tsui: Ok, thismeans that the sumof the factors of our two numbers are equal. What is the sumof Samuel Tsui’s and Jason Yang’s numbers? [i]Proposed by Samuel Tsui[/i]