Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, and $CA = 15$. Let $\Gamma$ be the circumcircle of $ABC$, let $O$ be its circumcenter, and let $M$ be the midpoint of minor arc $BC$. Circle $\omega_1$ is internally tangent to $\Gamma$ at $A$, and circle $\omega_2$, centered at $M$, is externally tangent to $\omega_1$ at a point $T$. Ray $AT$ meets segment $BC$ at point $S$, such that $BS - CS = \dfrac4{15}$. Find the radius of $\omega_2$

We say $p(x,y)\in \mathbb{R}\left[x,y\right]$ is [i]good[/i] if for any $y \neq 0$ we have $p(x,y) = p\left(xy,\frac{1}{y}\right)$ . Prove that there are good polynomials $r(x,y) ,s(x,y)\in \mathbb{R}\left[x,y\right]$ such that for any good polynomial $p$ there is a $f(x,y)\in \mathbb{R}\left[x,y\right]$ such that \[f(r(x,y),s(x,y))= p(x,y)\] [i]Proposed by Mohammad Ahmadi[/i]

For a positive integer $n$, denote with $b(n)$ the smallest positive integer $k$, such that there exist integers $a_1, a_2, \ldots, a_k$, satisfying $n=a_1^{33}+a_2^{33}+\ldots+a_k^{33}$. Determine whether the set of positive integers $n$ is finite or infinite, which satisfy: a) $b(n)=12;$ b) $b(n)=12^{12^{12}}.$

Show that $\sum^{\infty}_{n=1}\frac{(-1)^{n-1}\sin(\log n)}{n^\alpha}$ converges iff $\alpha>0$.

On a bookcase there are $ n \geq 3$ books side by side by different authors. A librarian considers the first and second book from left and exchanges them iff they are not alphabetically sorted. Then he is doing the same operation with the second and third book from left etc. Using this procedure he iterates through the bookcase three times from left to right. Considering all possible initial book configurations how many of them will then be alphabetically sorted?

Bobbo starts swimming at $2$ feet/s across a $100$ foot wide river with a current of $5$ feet/s. Bobbo doesn’t know that there is a waterfall $175$ feet from where he entered the river. He realizes his predicament midway across the river. What is the minimum speed that Bobbo must increase to make it to the other side of the river safely?

Let $D$ be an arbitrary point on the side $BC$ of triangle $ABC$. Points $E$ and $F$ are on $CA$ and $BA$ are such that $CD=CE$ and $BD=BF$. Lines $BE$ and $CF$ intersect at point $P$. Prove that when point $D$ varies along the line $BC$, $PD$ passes through a fixed point.

Let $G$ be a simple graph with $11$ vertices labeled as $v_{1} , v_{2} , ... , v_{11}$ such that the degree of $v_1$ equals to $2$ and the degree of other vertices are equal to $3$.If for any set $A$ of these vertices which $|A| \le 4$ , the number of vertices which are adjacent to at least one verex in $A$ and are not in $A$ themselves is at least equal to $|A|$ , then find the maximum possible number for the diameter of $G$. (The distance between two vertices of graph is the number of edges of the shortest path between them and the diameter of a graph , is the largest distance between arbitrary pairs in $V(G)$. ) [i]Proposed by Alireza Haqi[/i]

Compute the number of ordered quadruples of positive integers $(a,b,c,d)$ such that $$a!b!c!d!=24!$$$\textbf{(A)}~4$ $\textbf{(B)}~4!$ $\textbf{(C)}~4^4$ $\textbf{(D)}~\text{None of the above}$

Andile and Zandre play a game on a $2017 \times 2017$ board. At the beginning, Andile declares some of the squares [i]forbidden[/i], meaning the nothing may be placed on such a square. After that, they take turns to place coins on the board, with Zandre placing the first coin. It is not allowed to place a coin on a forbidden square or in the same row or column where another coin has already been placed. The player who places the last coin wins the game. What is the least number of squares Andile needs to declare as forbidden at the beginning to ensure a win? (Assume that both players use an optimal strategy.)

Let $a$ and $b$ be positive integers satisfying \[ \frac a{a-2} = \frac{b+2021}{b+2008} \] Find the maximum value $\dfrac ab$ can attain.

Given a cube with a side of $4$. Is it possible to completely cover $3$ of its faces, which have a common vertex, with sixteen rectangular paper strips measuring $1 \times3$?

On sides $AB$ and $BC$ of an equilateral triangle $ABC$ are taken points $D$ and $K$, and on the side $AC$ , points $E$ and $M$ so that $DA + AE = KC +CM = AB$. Prove that the angle between lines $DM$ and $KE$ is equal to $60^o$.

Prove that there exists a four-coloring of the set $M = \{1, 2, \cdots, 1987\}$ such that any arithmetic progression with $10$ terms in the set $M$ is not monochromatic. [b][i]Alternative formulation[/i][/b] Let $M = \{1, 2, \cdots, 1987\}$. Prove that there is a function $f : M \to \{1, 2, 3, 4\}$ that is not constant on every set of $10$ terms from $M$ that form an arithmetic progression. [i]Proposed by Romania[/i]

Compute the number of ways to erase 24 letters from the string ``OMOMO$\cdots$OMO'' (with length 27), such that the three remaining letters are O, M and O in that order. Note that the order in which they are erased does not matter. [i]Proposed by Yannick Yao

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

Adeline, Bonnie, and Cathy are walking along a long flat path, with their initial distances shown below. [asy] size(10cm); draw((0,0)--(12,0)--(28,0)); label("Adeline",(0,1)); label("Bonnie",(12,1)); label("Cathy",(28,1)); label("12 miles",(6,-1)); label("16 miles",(20,-1)); dot((0,0)); dot((12,0)); dot((28,0)); [/asy] Adeline and Bonnie walk towards each other at constant speeds of $1$ and $2$ miles per hour, respectively. Cathy walks in the same direction as Bonnie. If all three girls meet each other at the same time, what is Cathy's walking speed, in miles per hour? $\textbf{(A) } 4~\text{mph}\qquad\textbf{(B) } 4.5~\text{mph}\qquad\textbf{(C) } 5~\text{mph}\qquad\textbf{(D) } 5.5~\text{mph}\qquad\textbf{(E) } 6~\text{mph}$

Let $ABCD$ be a square and $E$ a point on side $CD$ such that $\angle DAE = 30^{\circ}$. The bisector of angle $\angle AEC$ intersects line $BD$ at point $F$. Lines $FC$ and $AE$ intersect at $S$. Find $\angle SDC$. [i]Proposed by Ana Boiangiu[/i]

A cube with edge of length $n$ ($n\ge 3$) consists of $n^3$ unit cubes. Prove that it is possible to write different $n^3$ integers on all the unit cubes to provide the zero sum of all integers in the every row parallel to some edge.

On the sides of a convex hexagon $ ABCDEF$ , equilateral triangles are constructd in its exterior. Prove that the third vertices of these six triangles are vertices of a regular hexagon if and only if the initial hexagon is [i]affine regular[/i]. (A hexagon is called affine regular if it is centrally symmetric and any two opposite sides are parallel to the diagonal determine by the remaining two vertices.)

Determine the number of ordered pairs of positive integers $(x,y)$ with $y < x \le 100$ such that $x^2-y^2$ and $x^3 - y^3$ are relatively prime. (Two numbers are [i]relatively prime[/i] if they have no common factor other than $1$.) [i]Ray Li[/i]

Two particles move along the edges of equilateral triangle $ \triangle ABC$ in the direction \[ A\rightarrow B\rightarrow C\rightarrow A \]starting simultaneously and moving at the same speed. One starts at $ A$, and the other starts at the midpoint of $ \overline{BC}$. The midpoint of the line segment joining the two particles traces out a path that encloses a region $ R$. What is the ratio of the area of $ R$ to the area of $ \triangle ABC$? $ \textbf{(A)}\ \frac {1}{16}\qquad \textbf{(B)}\ \frac {1}{12}\qquad \textbf{(C)}\ \frac {1}{9}\qquad \textbf{(D)}\ \frac {1}{6}\qquad \textbf{(E)}\ \frac {1}{4}$

In a $2\times n$ array we have positive reals s.t. the sum of the numbers in each of the $n$ columns is $1$. Show that we can select a number in each column s.t. the sum of the selected numbers in each row is at most $\frac{n+1}4$.

Prove that the only integer solution of the following system of equations is $u=v=x=y=z=0$: $$uv=x^2-5y^2, (u+v)(u+2v)=x^2-5z^2$$

Let \(n\) be a positive integer. For every positive integer $1 \leq k \leq n$ the sequence ${\displaystyle {\{ a_{i}+ki\}}_{i=1}^{n }}$ is defined, where $a_1,a_2, \dots ,a_n$ are integers. Among these \(n\) sequences, for at most how many of them does all the elements of the sequence give different remainders when divided by \(n\)?