Given an acute-angled triangle $ABC$ with orthocenter $H$. Reflection of nine-point circle about $AH$ intersects circumcircle at points $X$ and $Y$. Prove that $AH$ is the external bisector of $\angle XHY$. [i]Proposed by Mohammad Javad Shabani[/i]

An arbitrary circle can intersect the graph $ y \equal{} \sin x$ in $ \textbf{(A)} \text{ at most 2 points} \qquad \textbf{(B)} \text{ at most 4 points} \qquad$ $ \textbf{(C)} \text{ at most 6 points} \qquad \textbf{(D)} \text{ at most 8 points} \qquad$ $ \textbf{(E)} \text{ more than 16 points}$

Let be an isosceles trapezoid such that its smaller base is equal to its legs, and a rhombus that has each of its vertexes on a different side of the trapezoid. Prove that the smaller angles of the trapezoid are equal to the smaller ones of the rhombus. [i]Vlad Robu[/i]

How many ways are there to arrange the five letters P,U,M,A,C, such that the two vowels are not adjacent?

If $p$ is a prime number such that there exist positive integers $a$ and $b$ such that $\frac{1}{p}=\frac{1}{a^2}+\frac{1}{b^2}$ then $p$ is (A): $3$, (B): $5$, (C): $11$, (D): $7$, (E) None of the above.

We have $2015$ prisinoers.The king gives everyone a hat coloured in one of $5$ colors.Everyone sees all hats expect his own.Now,the King orders them in a line(a prisioner can see all guys behind and in front of him).The king asks the prisinoers one by one does he know the color of his hat.If he answers [b]NO[/b],then he is killed.If he answers [b]YES[/b],then answers which color is his hat,if his answers is true,he goes to freedom,if not,he is killed.All the prisinors can hear did he answer [b]YES[/b] or [b]NO[/b],but if he answered [b]YES[/b],they don't know what did he answered(he is killed in public).They can think of a strategy before the King comes,but after that they can't comunicate.What is the largest number of prisinors we can guarentee that can survive?

Let a complete oriented graph on $n$ points be given. Show that the vertices can be enumerated as $v_1 , v_2 ,\ldots, v_n$ such that $v_1 \rightarrow v_2 \rightarrow \cdots \rightarrow v_n.$

The first four terms in an arithmetic sequence are $ x \plus{} y$, $ x \minus{} y$, $ xy$, and $ x/y$, in that order. What is the fifth term? $ \textbf{(A)}\ \minus{}\frac{15}{8} \qquad \textbf{(B)}\ \minus{}\frac{6}{5} \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ \frac{27}{20} \qquad \textbf{(E)}\ \frac{123}{40}$

Find the greatest positive integer $n$ for which $n$ is divisible by all positive integers whose cube is not greater than $n.$

Let $f(z) = az^4+ bz^3+ cz^2+ dz + e = a(z -r_1)(z -r_2)(z -r_3)(z -r_4)$ where $a, b, c, d, e$ are integers, $a \not= 0$. Show that if $r_1 + r_2$ is a rational number, and if $r_1 + r_2 \neq r_3 + r_4$, then $r_1r_2$ is a rational number.

Let $ABCD$ be a convex quadrilateral with $BC=2$ and $CD=6.$ Suppose that the centroids of $\triangle ABC,\triangle BCD,$ and $\triangle ACD$ form the vertices of an equilateral triangle. What is the maximum possible value of the area of $ABCD$? $\textbf{(A) } 27 \qquad\textbf{(B) } 16\sqrt3 \qquad\textbf{(C) } 12+10\sqrt3 \qquad\textbf{(D) } 9+12\sqrt3 \qquad\textbf{(E) } 30$

Let $n$ be a positive integer greater than $1$ and let us call an arbitrary set of cells in a $n\times n$ square $\textit{good}$ if they are the intersection cells of several rows and several columns, such that none of those cells lie on the main diagonal. What is the minimum number of pairwise disjoint $\textit{good}$ sets required to cover the entire table without the main diagonal?

Let $p$ be a prime, and $n > p$ be an integer. Prove that \[ \binom{n+p-1}{p} - \binom{n}{p} \] is divisible by $n$.

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

Let be a $ 2\times 2 $ real matrix $ A $ that has the property that $ \left| A^d-I_2 \right| =\left| A^d+I_2 \right| , $ for all $ d\in\{ 2014,2016 \} . $ Prove that $ \left| A^n-I_2 \right| =\left| A^n+I_2 \right| , $ for any natural number $ n. $

Determine all functions $f : R\to R$ satisfying: $$f(xy + 2x + 2y - 1) = f(x)f(y) + f(y) + x -2$$ for all real numbers $x, y$.

Let $ABC$ be a triangle with altitude $\overline{AE}$. The $A$-excircle touches $\overline{BC}$ at $D$, and intersects the circumcircle at two points $F$ and $G$. Prove that one can select points $V$ and $N$ on lines $DG$ and $DF$ such that quadrilateral $EVAN$ is a rhombus. [i]Danielle Wang and Evan Chen[/i]

Solve the system of equation $$x+y+z=2;$$$$(x+y)(y+z)+(y+z)(z+x)+(z+x)(x+y)=1;$$$$x^2(y+z)+y^2(z+x)+z^2(x+y)=-6.$$

Centered at each lattice point in the coordinate plane are a circle of radius $\tfrac{1}{10}$ and a square with sides of length $\tfrac{1}{5}$ whose sides are parallel to the coordinate axes. The line segment from $(0, 0)$ to $(1001, 429)$ intersects $m$ of the squares and $n$ of the circles. Find $m + n$.

Let $ABCDA'B'C'D'$ be a cube (where $ABCD$ and $A'B'C'D'$ are faces and $AA',BB',CC',DD'$ are edges). Consider the four lines $AA', BC, D'C'$ and the line joining the midpoints of $BB'$ and $DD'$. Show that there is no line which cuts all the four lines.

Find all positive integers $n$ such that we can put $n$ equal squares on the plane that their sides are horizontal and vertical and the shape after putting the squares has at least $3$ axises.

Let $n > 1$ be a fixed integer. Alberto and Barbara play the following game: (i) Alberto chooses a positive integer, (ii) Barbara chooses an integer greater than $1$ which is a multiple or submultiple of the number Alberto chose (including itself), (iii) Alberto increases or decreases the Barbara’s number by $1$. Steps (ii) and (iii) are alternatively repeated. Barbara wins if she succeeds to reach the number $n$ in at most $50$ moves. For which values of $n$ can she win, no matter how Alberto plays?

Kimothy starts in the bottom-left square of a $4$ by $4$ chessboard. In one step, he can move up, down, left, or right to an adjacent square. Kimothy takes $16$ steps and ends up where he started, visiting each square exactly once (except for his starting/ending square). How many paths could he have taken?

Which one of the following is [i] not [/i] true for the equation \[ix^2-x+2i=0,\] where $i=\sqrt{-1}$? $ \textbf{(A)}\ \text{The sum of the roots is 2} \qquad$ $\textbf{(B)}\ \text{The discriminant is 9}\qquad$ $\textbf{(C)}\ \text{The roots are imaginary}\qquad$ $\textbf{(D)}\ \text{The roots can be found using the quadratic formula}\qquad$ $\textbf{(E)}\ \text{The roots can be found by factoring, using imaginary numbers} $

In a triangle $ABC$ with $B = 90^\circ$, $D$ is a point on the segment $BC$ such that the inradii of triangles $ABD$ and $ADC$ are equal. If $\widehat{ADB} = \varphi$ then prove that $\tan^2 (\varphi/2) = \tan (C/2)$.