Let $ABCD$ be a rectangle of centre $O$, such that $\angle DAC=60^{\circ}$. The angle bisector of $\angle DAC$ meets $DC$ at $S$. Lines $OS$ and $AD$ meet at $L$, and lines $BL$ and $AC$ meet at $M$. Prove that lines $SM$ and $CL$ are parallel.

Let $ABC$ be an acute triangle. Let $D$ be a point on side $AB$ and $E$ be a point on side $AC$ such that lines $BC$ and $DE$ are parallel. Let $X$ be an interior point of $BCED$. Suppose rays $DX$ and $EX$ meet side $BC$ at points $P$ and $Q$, respectively, such that both $P$ and $Q$ lie between $B$ and $C$. Suppose that the circumcircles of triangles $BQX$ and $CPX$ intersect at a point $Y \neq X$. Prove that the points $A, X$, and $Y$ are collinear.

Let $ n\ge2$ be a positive integer and denote by $ S_n$ the set of all permutations of the set $ \{1,2,\ldots,n\}$. For $ \sigma\in S_n$ define $ l(\sigma)$ to be $ \displaystyle\min_{1\le i\le n\minus{}1}\left|\sigma(i\plus{}1)\minus{}\sigma(i)\right|$. Determine $ \displaystyle\max_{\sigma\in S_n}l(\sigma)$.

Let $M,N$ and $P$ be the midpoints of sides $BC,CA$ and $AB$ respectively, of the acute triangle $ABC.$ Let $A',B'$ and $C'$ be the antipodes of $A,B$ and $C$ in the circumcircle of triangle $ABC.$ On the open segments $MA',NB'$ and $PC'$ we consider points $X,Y$ and $Z$ respectively such that \[\frac{MX}{XA'}=\frac{NY}{YB'}=\frac{PZ}{ZC'}.\][list=a] [*]Prove that the lines $AX,BY,$ and $CZ$ are concurrent at some point $S.$ [*]Prove that $OS<OG$ where $O$ is the circumcenter and $G$ is the centroid of triangle $ABC.$ [/list]

Let $F(n)$ denote the smallest positive integer greater than $n$ whose sum of digits is equal to the sum of the digits of $n$. For example, $F(2019) = 2028$. Compute $F(1) + F(2) + \dots + F(1000).$ [i]Proposed by Sean Li[/i]

Regular hexagon $ABCDEF$ has side length $2$. Let $G$ be the midpoint of $\overline{AB}$, and let $H$ be the midpoint of $\overline{DE}$. What is the perimeter of $GCHF$? $ \textbf{(A)}\ 4\sqrt3 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 4\sqrt5 \qquad \textbf{(D)}\ 4\sqrt7 \qquad \textbf{(E)}\ 12$

As illustrated below, we can dissect every triangle $ABC$ into four pieces so that piece 1 is a triangle similar to the original triangle, while the other three pieces can be assembled into a triangle also similar to the original triangle. Determine the ratios of the sizes of the three triangles and verify that the construction works. [asy] import olympiad;size(350);defaultpen(linewidth(0.7)+fontsize(10)); path p=origin--(13,0)--(9,8)--cycle; path p2=rotate(180)*p, p3=shift(-26,0)*scale(2)*p, p4=shift(-27,-24)*scale(3)*p, p1=shift(-53,-24)*scale(4)*p; pair A=(-53,-24), B=(-8,16), C=(12,-24), D=(-17,8), E=(-1,-24), F=origin, G=(-13,0), H=(-9,-8); label("1", centroid(A,D,E)); label("2", centroid(F,G,H)); label("3", (-10,6)); label("4", (0,-15)); draw(p2^^p3^^p4); filldraw(p1, white, black); pair point = centroid(F,G,H); label("$\mathbf{A}$", A, dir(point--A)); label("$\mathbf{B}$", B, dir(point--B)); label("$\mathbf{C}$", C, dir(point--C)); label("$\mathbf{D}$", D, dir(point--D)); label("$\mathbf{E}$", E, dir(point--E)); label("$\mathbf{F}$", F, dir(point--F)); label("$\mathbf{G}$", G, dir(point--G)); label("$\mathbf{H}$", H, dir(point--H)); real x=90; draw(shift(x)*p1); label("1", centroid(shift(x)*A,shift(x)*D,shift(x)*E)); draw(shift(130,0)*p4); draw(shift(130,0)*shift(-27,-24)*p); draw(shift(130,0)*shift(-1,-24)*p3); label("2", shift(130,0)*shift(-27,-24)*centroid(F,(9,8),(13,0))); label("3", shift(130,0)*shift(-1,-24)*(-10,6)); label("4", shift(130,0)*(0,-15)); label("Piece 2 rotated $180^\circ$", (130,10));[/asy]

Let a sequence $\{a_n\}$, $n \in \mathbb{N}^{*}$ given, satisfying the condition \[0 < a_{n+1} - a_n \leq 2001\] for all $n \in \mathbb{N}^{*}$ Show that there are infinitely many pairs of positive integers $(p, q)$ such that $p < q$ and $a_p$ is divisor of $a_q$.

Prove that for every positive integer $n$, the number $A_n = 7^{2n} -48n - 1$ is a multiple of $9$.

A row of $2n$ real numbers is called [i]“Sozopolian”[/i], if for each $m$, such that $1\leq m\leq 2n$, the sum of the first $m$ members of the row is an integer or the sum of the last $m$ members of the row is an integer. What’s the least number of integers that a [i]Sozopolian[/i] row can have, if the number of its members is: a) 2016; b) 2017?

Point $P$ is $9$ units from the center of a circle of radius $15$. How many different chords of the circle contain $P$ and have integer lengths? $ \textbf{(A)}\ 11\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 29 $

Let $N_{13}$ be the answer to problem 13, and let $k = \tfrac{1}{N_{13} + 6}$. Compute the infinite product \[ (1 - k + k^2)(1 - k^3 + k^6)(1 - k^9 + k^{18})(1 - k^{27} + k^{54})\cdots, \] where the factors take the form $(1 - k^{3^a} + k^{2\cdot 3^a})$ for all nonnegative integers $a$.

Suppose the roots of $$x^4 - 3x^2 + 6x - 12 = 1$$ are $\alpha$, $\beta$, $\gamma$ , and $\delta$. What is the value of $$\frac{\alpha+ \beta+ \gamma }{\delta^2}+\frac{\alpha+ \delta+ \gamma}{\beta^2}+\frac{\alpha+ \beta+ \delta}{\gamma^2}+\frac{\delta+ \beta+ \gamma }{\alpha^2}?$$

Find all complex numbers $m$ such that polynomial \[x^3 + y^3 + z^3 + mxyz\] can be represented as the product of three linear trinomials.

What number is directly above $142$ in this array of numbers? \[\begin{array}{cccccc} & & & 1 & & \\ & & 2 & 3 & 4 & \\ & 5 & 6 & 7 & 8 & 9 \\ 10 & 11 & 12 & \cdots & & \\ \end{array}\] $\textbf{(A)}\ 99 \qquad \textbf{(B)}\ 119 \qquad \textbf{(C)}\ 120 \qquad \textbf{(D)}\ 121 \qquad \textbf{(E)}\ 122$

Two sequences $\{a_i\}$ and $\{b_i\}$ are defined as follows: $\{ a_i \} = 0, 3, 8, \dots, n^2 - 1, \dots$ and $\{ b_i \} = 2, 5, 10, \dots, n^2 + 1, \dots $. If both sequences are defined with $i$ ranging across the natural numbers, how many numbers belong to both sequences? [i]Proposed by Isabella Grabski[/i]

Find all functions $f : N\rightarrow N - \{1\}$ satisfying $f (n)+ f (n+1)= f (n+2) +f (n+3) -168$ for all $n \in N$ .

Given a pentagon $ABCDE$ with all its interior angles less than $180^\circ$. Prove that if $\angle ABC = \angle ADE$ and $\angle ADB = \angle AEC$, then $\angle BAC = \angle DAE$.

Postman Pete has a pedometer to count his steps. The pedometer records up to $ 99999$ steps, then flips over to $ 00000$ on the next step. Pete plans to determine his mileage for a year. On January $ 1$ Pete sets the pedometer to $ 00000$. During the year, the pedometer flips from $ 99999$ to $ 00000$ forty-four times. On December $ 31$ the pedometer reads $ 50000$. Pete takes $ 1800$ steps per mile. Which of the following is closest to the number of miles Pete walked during the year? $ \textbf{(A)}\ 2500 \qquad \textbf{(B)}\ 3000 \qquad \textbf{(C)}\ 3500 \qquad \textbf{(D)}\ 4000 \qquad \textbf{(E)}\ 4500$

Compute the number of triangles of different sizes which contain the gray triangle in the figure below. [asy] size(5cm); real n = 4; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); } for (int i = 0; i < n; ++i) { draw((i,0)--((n+i)/2,(n-i)*0.866)); } filldraw((1.5,0.866)--(2,2*0.866)--(2.5,0.866)--cycle, gray); [/asy] [i]Proposed by Nathan Xiong[/i]

A positive integer $n$ has the property that, for any $2$ integers $a$ and $b$, if $ab + 1$ is divisible by $n$, then $a + b$ is also divisible by $n$. What is the largest possible value of $n$?

(a) Find a solution that is not identically zero, of the homogeneous linear differential equation $$(3x^2-x-1)y''-(9x^2+9x-2)y'+(18x+3)y=0.$$ Intelligent guessing of the form of a solution may be helpful. (b) Let $y=f(x)$ be the solution of the [i]nonhomogeneous[/i] differential equation $$(3x^2-x-1)y''-(9x^2+9x-2)y'+(18x+3)y=6(6x+1)$$ that has $f(0)=1$ and $(f(-1)-2)(f(1)-6)=1.$ Find integers $a,b,c$ such that $(f(-2)-a)(f(2)-b)=c.$

$a,b,c \in (0,1)$ and $x,y,z \in ( 0, \infty)$ reals satisfies the condition $a^x=bc,b^y=ca,c^z=ab$. Prove that \[ \dfrac{1}{2+x}+\dfrac{1}{2+y}+\dfrac{1}{2+z} \leq \dfrac{3}{4} \] \\

A paper square was bent by a line in such way that one vertex came to a side not containing this vertex. Three circles are inscribed into three obtained triangles (see Figure). Prove that one of their radii is equal to the sum of the two remaining ones. (L.Steingarts)

Let $m$ and $n$ be positive integers, where $m < 2^n.$ Determine the smallest possible number of not necessarily pairwise distinct powers of two that add up to $m\cdot(2^n- 1).$ [i]The Problem Selection Committee[/i]