In convex hexagon $ABCDEF$, $\angle A \cong \angle B$, $\angle C \cong \angle D$, and $\angle E \cong \angle F$. Prove that the perpendicular bisectors of $\overline{AB}$, $\overline{CD}$, and $\overline{EF}$ pass through a common point. [i]Proposed by Lewis Chen[/i]

Let $\alpha\neq0$ be a real number. Determine all functions $f:\mathbb R\to\mathbb R$ such that \[f\left(x^2+y^2\right)=f(x-y)f(x+y)+\alpha yf(y)\] holds for all $x, y\in\mathbb R.$

Let $S$ be the set of all partitions of $2000$ (in a sum of positive integers). For every such partition $p$, we define $f (p)$ to be the sum of the number of summands in $p$ and the maximal summand in $p$. Compute the minimum of $f (p)$ when $p \in S .$

Let $ABC$ be a triangle with side lengths $AB = 13$, $AC = 17$, and $BC = 20$. Let $E, F$ be the feet of the altitudes from $B$ onto $AC$ and $C$ onto $AB$, respectively. Let $P$ be the second intersection of the circumcircles of $ABC$ and $AEF$. Suppose that $AP$ can be written as $\frac{a \sqrt{b}}{c}$ where $a, c$ are relatively prime and $b$ is square-free. Compute $a$.

On a line $n+1$ segments are marked such that one of the points of the line is contained in all of them. Prove that one can find $2$ distinct segments $I, J$ which intersect at a segment of length at least $\frac{n-1}{n}d$, where $d$ is the length of the segment $I$.

Let $p(x)$ be the monic cubic polynomial with roots $\sin^2(1^{\circ})$, $\sin^2(3^{\circ})$, and $\sin^2(9^{\circ})$. Suppose that $p\left(\frac{1}{4}\right)=\frac{\sin(a^{\circ})}{n\sin(b^{\circ})}$, where $0 <a,b \le 90$ and $a,b,n$ are positive integers. What is $a+b+n$? [i]Proposed by Andrew Yuan[/i]

Let $ ABCD $ be a regular tetahedron and $ M,N $ be middlepoints for $ AD, $ respectively, $ BC. $ Through a point $ P $ that is on segment $ MN, $ passes a plane perpendicular on $ MN, $ and meets the sides $ AB,AC,CD,BD $ of the tetahedron at $ E,F,G, $ respectively, $ H. $ [b]a)[/b] Prove that the perimeter of the quadrilateral $ EFGH $ doesn't depend on $ P. $ [b]b)[/b] Determine the maximum area of $ EFGH $ (depending on a side of the tetahedron).

Prove that there exist infinitely many collections of positive integers $ (a,b,c,d,e,f)$ such that $ a < b < c$ and the equalities $ ab \minus{} c \equal{} de,$ $ bc \minus{} a \equal{} ef$ and $ ac \minus{} b \equal{} df$ hold.

In the coordinate space, each of the eight vertices of a rectangular box has integer coordinates. If the volume of the solid is $2011$, prove that the sides of the rectangular box are parallel to the coordinate axes.

Equilateral triangle $T_0$ with side length $3$ is on a plane. Given triangle $T_n$ on the plane, triangle $T_{n+1}$ is constructed on the plane by translating $T_n$ by $1$ unit, in one of six directions parallel to one of the sides of $T_n$. The direction is chosen uniformly at random. Let $a$ be the least integer such that at most one point on the plane is in or on all of $T_0, T_1, T_2, \ldots, T_a$. It can be shown that $a$ exists with probability $1$. Find the probability that $a$ is even. [i]Proposed by Justin Hseih[/i]

In the $\triangle ABC$ shown, $D$ is some interior point, and $x, y, z, w$ are the measures of angles in degrees. Solve for $x$ in terms of $y, z$ and $w$. [asy] draw((0,0)--(10,0)--(2,7)--cycle); draw((0,0)--(4,3)--(10,0)); label("A", (0,0), SW); label("B", (10,0), SE); label("C", (2,7), W); label("D", (4,3), N); label("x", (2.25,6)); label("y", (1.5,2), SW); label("$z$", (7.88,1.5)); label("w", (4,2.85), S); [/asy] $ \textbf{(A)}\ w-y-z \qquad\textbf{(B)}\ w-2y-2z \qquad\textbf{(C)}\ 180-w-y-z \\ \qquad\textbf{(D)}\ 2w-y-z \qquad\textbf{(E)}\ 180-w+y+z $

Find all injective functions $f : R \to R$ such that for all real $x \ne y$ , $f\left(\frac{x+y}{x-y}\right) = \frac{f(x)+ f(y)}{f(x)- f(y)}$

In a row, $1000$ numbers \(2\) and $2000$ numbers \(-1\) are written in some order. Mykhailo counted the number of groups of adjacent numbers, consisting of at least two numbers, whose sum equals \(0\). (a) Find the smallest possible value of this number. (b) Find the largest possible value of this number. [i]Proposed by Anton Trygub[/i]

4. A square can be divided into four congruent figures as shown: [asy] size(2cm); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((1,0)--(1,2)); draw((0,1)--(2,1)); [/asy] For how many $n$ with $1 \le n \le 100$ can a unit square be divided into $n$ congruent figures? 5. If $x + 2y - 3z = 7$ and $2x - y + 2z = 6$, determine $8x + y$. 6. Let $ABCD$ be a rectangle, and let $E$ and $F$ be points on segment $AB$ such that $AE = EF = FB$. If $CE$ intersects the line $AD$ at $P$, and $PF$ intersects $BC$ at $Q$, determine the ratio of $BQ$ to $CQ$.

Let $a_1 = 20$, $a_2 = 16$, and for $k \ge 3$, let $a_k = \sqrt[3]{k-a_{k-1}^3-a_{k-2}^3}$. Compute $a_1^3+a_2^3+\cdots + a_{10}^3$.

Initially, a non-constant polynomial $S(x)$ with real coefficients is written down on a board. Whenever the board contains a polynomial $P(x)$, not necessarily alone, one can write down on the board any polynomial of the form $P(C + x)$ or $C + P(x)$ where $C$ is a real constant. Moreover, if the board contains two (not necessarily distinct) polynomials $P(x)$ and $Q(x)$, one can write $P(Q(x))$ and $P(x) + Q(x)$ down on the board. No polynomial is ever erased from the board. Given two sets of real numbers, $A = \{ a_1, a_2, \dots, a_n \}$ and $B = \{ b_1, \dots, b_n \}$, a polynomial $f(x)$ with real coefficients is $(A,B)$-[i]nice[/i] if $f(A) = B$, where $f(A) = \{ f(a_i) : i = 1, 2, \dots, n \}$. Determine all polynomials $S(x)$ that can initially be written down on the board such that, for any two finite sets $A$ and $B$ of real numbers, with $|A| = |B|$, one can produce an $(A,B)$-[i]nice[/i] polynomial in a finite number of steps. [i]Proposed by Navid Safaei, Iran[/i]

Let triangle $ABC$ have $\angle BAC = 45^{\circ}$ and circumcircle $\Gamma$ and let $M$ be the intersection of the angle bisector of $\angle BAC$ with $\Gamma$. Let $\Omega$ be the circle tangent to segments $\overline{AB}$ and $\overline{AC}$ and internally tangent to $\Gamma$ at point $T$. Given that $\angle TMA = 45^{\circ}$ and that $TM = \sqrt{100 - 50 \sqrt{2}}$, the length of $BC$ can be written as $a \sqrt{b}$, where $b$ is not divisible by the square of any prime. Find $a + b$.

Solve the quasi-homogeneous equation \[\ddot{x}=x^5+x^2\dot{x}\]

Consider $\vartriangle ABC$, with $AD$ bisecting $\angle BAC$, $D$ on segment $BC$. Let $E$ be a point on $BC$, such that $BD = EC$. Through $E$ we draw the line $\ell$ parallel to $AD$ and consider a point $ P$ on it and inside the $\vartriangle ABC$. Let $G$ be the point where line $BP$ cuts side $AC$ and let F be the point where line $CP$ to side $AB$. Show that $BF = CG$.

Find all $(x, y, z, n) \in {\mathbb{N}}^4$ such that $ x^3 +y^3 +z^3 =nx^2 y^2 z^2$.

Let $G$ be a simple graph with $3n^2$ vertices ($n\geq 2$). It is known that the degree of each vertex of $G$ is not greater than $4n$, there exists at least a vertex of degree one, and between any two vertices, there is a path of length $\leq 3$. Prove that the minimum number of edges that $G$ might have is equal to $\frac{(7n^2- 3n)}{2}$.

Find the area of the region in the $xy$-plane satisfying $x^6-x^2+y^2 \le 0$.

Let $ABCD$ be a square of side paper $10$ and $P$ a point on side $BC$. By folding the paper along the $AP$ line, point $B$ determines the point $Q$, as seen in the figure. The line $PQ$ cuts the side $CD$ at $R$. Calculate the perimeter of the triangle $ PCR$ [img]https://3.bp.blogspot.com/-ZSyCUznwutE/XNY7cz7reQI/AAAAAAAAKLc/XqgQnjm8DQYq6Q7fmCAKJwKt3ihoL8AuQCK4BGAYYCw/s400/may%2B2013%2Bl1.png[/img]

Let $f:[0,1]\to\mathbb R$ be a differentiable function, while $f'$ is continuous on $[0,1]$ and $|f'(x)|\le1$, $(\forall)x\in[0,1]$. If $$2\left|\int^1_0f(x)dx\right|\le1$$ Show that: $$(n+2)\left|\int^1_0x^nf(x)dx\right|\le1,~(\forall)x\ge1$$ [i]Proposed by Florin Stănescu and Şerban Cioculescu[/i]

Given a $24 \times 24$ square grid, initially all its unit squares are coloured white. A move consists of choosing a row, or a column, and changing the colours of all its unit squares, from white to black, and from black to white. Is it possible that after finitely many moves, the square grid contains exactly $574$ black unit squares?