Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals. Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded? [i]Proposed by Mihai Bălună, Romania[/i]

The orthogonal projections of the vertices $A, B, C$ of the tetrahedron $ABCD$ on the opposite faces are denoted by $A', B', C'$ respectively. Suppose that point $A'$ is the circumcenter of the triangle $BCD$, point $B'$ is the incenter of the triangle $ACD$ and $C'$ is the centroid of the triangle $ABD$. Prove that tetrahedron $ABCD$ is regular.

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ which satisfy $yf(x)+f(y) \geq f(xy)$

For four pairwise different positive integers $a,b,c$ and $d$ six numbers are calculated: $ab+10$,$ac+10$,$ad+10$,$bc+10$,$bd+10$ and $cd+10$. Find the maximum amount of them which can be perfect squares.

Dorothy organized a party for the birthday of Duck Mom and she also prepared a cylindershaped cake. Since she was originally expecting to have $15$ guests, she divided the top of the cake into this many equal circular sectors, marking where the cuts need to be made. Just for fun Dorothy’s brother Donald split the top of the cake into $10$ equal circular sectors in such a way that some of the radii that he marked coincided with Dorothy’s original markings. Just before the arrival of the guests Douglas cut the cake according to all markings, and then he placed the cake into the fridge. This way they forgot about the cake and only got to eating it when only $6$ of them remained. Is it possible for them to divide the cake into $6$ equal parts without making any further cuts?

$O$ is a circumcircle of $ABC$ and $CO$ meets $AB$ at $P$, and $BO$ meets $AC$ at $Q$. Show that $BP=PQ=QC$ if and only if $\angle A=60^{\circ}$.

Let $k\ge 14$ be an integer, and let $p_k$ be the largest prime number which is strictly less than $k$. You may assume that $p_k\ge 3k/4$. Let $n$ be a composite integer. Prove: (a) if $n=2p_k$, then $n$ does not divide $(n-k)!$; (b) if $n>2p_k$, then $n$ divides $(n-k)!$.

The numbers $a_1,a_2$ and $a_3$ are distinct positive integers, such that (i) $a_1$ is a divisor of $a_2+a_3+a_2a_3$; (ii) $a_2$ is a divisor of $a_3+a_1+a_3a_1$; (iii) $a_3$ is a divisor of $a_1+a_2+a_1a_2$. Prove that $a_1,a_2$ and $a_3$ cannot all be prime.

Convex octagon $AC_1BA_1CB_1$ satisfies: $AB_1=AC_1$, $BC_1=BA_1$, $CA_1=CB_1$ and $\angle{A}+\angle{B}+\angle{C}=\angle{A_1}+\angle{B_1}+\angle{C_1}$. Prove that the area of $\triangle{ABC}$ is equal to half the area of the octagon.

Let $n \ge 3$ be an odd integer. Each cell is a $n \times n$ board painted in yellow or blue. Let's call the sequence of cells $S_1, S_2,...,S_m$ [i]path [/i] if they are all the same color and the cells $S_i$ and $S_j$ have one in common an edge if and only if $|i - j| = 1$. Suppose that all yellow cells form a path and all the blue cells form a path. Prove that one of the two paths begins or ends at the center of the board.

Given a point $ P$ inside a triangle $ \triangle ABC$. Let $ D$, $ E$, $ F$ be the orthogonal projections of the point $ P$ on the sides $ BC$, $ CA$, $ AB$, respectively. Let the orthogonal projections of the point $ A$ on the lines $ BP$ and $ CP$ be $ M$ and $ N$, respectively. Prove that the lines $ ME$, $ NF$, $ BC$ are concurrent. [i]Original formulation:[/i] Let $ ABC$ be any triangle and $ P$ any point in its interior. Let $ P_1, P_2$ be the feet of the perpendiculars from $ P$ to the two sides $ AC$ and $ BC.$ Draw $ AP$ and $ BP,$ and from $ C$ drop perpendiculars to $ AP$ and $ BP.$ Let $ Q_1$ and $ Q_2$ be the feet of these perpendiculars. Prove that the lines $ Q_1P_2,Q_2P_1,$ and $ AB$ are concurrent.

Let $f(x)= a_1 \sin x + a_2 \sin 2x+\cdots +a_{n} \sin nx $, where $a_1 ,a_2 ,\ldots,a_n $ are real numbers and where $n$ is a positive integer. Given that $|f(x)| \leq | \sin x |$ for all real $x,$ prove that $$|a_1 +2a_2 +\cdots +na_{n}|\leq 1.$$

In $\triangle ABC$, $A,B,C$ are arithmetic sequence, and $c-a$ is equal to height on side $BC$, then $\sin\frac{C-A}{2}=$________.

A base $9$ number [i]probably places[/i] if it has a $7$ as one of its digits. Find the number of base $9$ numbers less than or equal to $100$ in base $10$ that probably place.

Given an even positive integer $m$, find all positive integers $n$ for which there exists a bijection $f:[n]\to [n]$ so that, for all $x,y\in [n]$ for which $n\mid mx-y$, $$(n+1)\mid f(x)^m-f(y).$$ Note: For a positive integer $n$, we let $[n] = \{1,2,\dots, n\}$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

For $a\geq 0$, find the minimum value of $S(a)=\int_0^1 |x^2+2ax+a^2-1|\ dx.$

Let $H$ be an orthocenter of an acute triangle $ABC$. Prove that midpoints of $AB$ and $CH$ and intersection point of angle bisectors of $\angle CAH$ and $\angle CBH$ lie on the same line.

A subset $B$ of $\{1, 2, \dots, 2017\}$ is said to have property $T$ if any three elements of $B$ are the sides of a nondegenerate triangle. Find the maximum number of elements that a set with property $T$ may contain.

Prove that there are infinitely many sets of four positive integers so that the sum of the squares of any three elements is a perfect square.

Let the excircle of triangle $ABC$ opposite the vertex $A$ be tangent to the side $BC$ at the point $A_1$. Define the points $B_1$ on $CA$ and $C_1$ on $AB$ analogously, using the excircles opposite $B$ and $C$, respectively. Suppose that the circumcentre of triangle $A_1B_1C_1$ lies on the circumcircle of triangle $ABC$. Prove that triangle $ABC$ is right-angled. [i]Proposed by Alexander A. Polyansky, Russia[/i]

Let $ABC$ be an acute triangle with orthocenter $H$, and let $BE$ and $CF$ be the altitudes of the triangle. Choose two points $P$ and $Q$ on rays $BH$ and $CH$ respectively, such that: $\bullet$ $PQ$ is parallel to $BC$; $\bullet$ The quadrilateral $APHQ$ is cyclic. Suppose the circumcircles of triangles $APF$ and $AQE$ meet again at $X\neq A$. Prove that $AX$ is parallel to $BC$. [i]Proposed by Ivan Chan Kai Chin[/i]

In the $x$-$y$ plane, for $t>0$, denote by $S(t)$ the area of the part enclosed by the curve $y=e^{t^2x}$, the $x$-axis, $y$-axis and the line $x=\frac{1}{t}.$ Show that $S(t)>\frac 43.$ If necessary, you may use $e^3>20.$

A square has sides of length $ 10$, and a circle centered at one of its vertices has radius $ 10$. What is the area of the union of the regions enclosed by the square and the circle? $ \textbf{(A)}\ 200 \plus{} 25\pi\qquad \textbf{(B)}\ 100 \plus{} 75\pi\qquad \textbf{(C)}\ 75 \plus{} 100\pi\qquad \textbf{(D)}\ 100 \plus{} 100\pi$ $ \textbf{(E)}\ 100 \plus{} 125\pi$

Every positive integer is either [i]nice [/i] or [i]naughty[/i], and the Oracle of Numbers knows which are which. However, the Oracle will not directly tell you whether a number is [i]nice [/i] or [i]naughty[/i]. The only questions the Oracle will answer are questions of the form “What is the sum of all nice divisors of $n$?,” where $n$ is a number of the questioner’s choice. For instance, suppose ([i]just [/i] for this example) that $2$ and $3$ are nice, while $1$ and $6$ are [i]naughty[/i]. In that case, if you asked the Oracle, “What is the sum of all nice divisors of $6$?,” the Oracle’s answer would be $5$. Show that for any given positive integer $n$ less than $1$ million, you can determine whether $n$ is [i]nice [/i] or [i]naughty [/i] by asking the Oracle at most four questions.

Let $ABC$ be a triangle with $\angle BAC = 60^{\circ}$. Let $AP$ bisect $\angle BAC$ and let $BQ$ bisect $\angle ABC$, with $P$ on $BC$ and $Q$ on $AC$. If $AB + BP = AQ + QB$, what are the angles of the triangle?