Let $AB$ be the diameter of circle $\Gamma$ centred at $O$. Point $C$ lies on ray $\overrightarrow{AB}$. The line through $C$ cuts circle $\Gamma$ at $D$ and $E$, with point $D$ being closer to $C$ than $E$ is. $OF$ is the diameter of the circumcircle of triangle $BOD$. Next, construct $CF$, cutting the circumcircle of triangle $BOD$ at $G$. Prove that $O,A,E,G$ are concyclic. (Possibly proposed by Pak Wono)

Prove that for all positive real numbers $x, y$ and $z$, the double inequality $$0 < \frac{1}{x + y + z + 1} -\frac{1}{(x + 1)(y + 1)(z + 1)} \le \frac18$$ holds. When does equality hold in the right inequality? [i](Walther Janous)[/i]

A positive integer $M$ has been represented as a product of primes. Each of these primes is increased by 1 . The product $N$ of the new multipliers is divisible by $M$ . Prove that if we represent $N$ as a product of primes and increase each of them by 1 then the product of the new multipliers will be divisible by $N$ . Alexandr Gribalko

Consider acute $\triangle ABC$ with altitudes $AA_1, BB_1$ and $CC_1$ ($A_1 \in BC,B_1 \in AC,C_1 \in AB$). A point $C' $ on the extension of $B_1A_1$ beyond $A_1$ is such that $A_1C' = B_1C_1$. Analogously, a point $B'$ on the extension of A$_1C_1$ beyond $C_1$ is such that $C_1B' = A_1B_1$ and a point $A' $ on the extension of $C_1B_1$ beyond $B_1$ is such that $B_1A' = C_1A_1$. Denote by $A'', B'', C''$ the symmetric points of $A' , B' , C'$ with respect to $BC, CA$ and $AB$ respectively. Prove that if $R, R'$ and R'' are circumradiii of $\triangle ABC, \triangle A'B'C'$ and $\triangle A''B''C''$, then $R, R'$ and $R'' $ are sidelengths of a triangle with area equals one half of the area of $\triangle ABC$.

Let $S$ be a finite set of integers. Suppose that for every two different elements of $S$, $p$ and $q$, there exist not necessarily distinct integers $a \neq 0$, $b$, $c$ belonging to $S$, such that $p$ and $q$ are the roots of the polynomial $ax^{2}+bx+c$. Determine the maximum number of elements that $S$ can have.

Chelsea goes to La Verde's at MIT and buys $100$ coconuts, each weighing $4$ pounds, and $100$ honeydews, each weighing $5$ pounds. She wants to distribute them among $n$ bags, so that each bag contains at most $13$ pounds of fruit. What is the minimum $n$ for which this is possible?

Emily has an infinite number of balls and empty boxes available to her. The empty boxes, each capable of holding four balls, are arranged in a row from left to right. At the first step, she places a ball in the first box of the row. At each subsequent step, she places a ball in the first box of the row that still has room for a ball and empties any previous boxes. How many balls in total are in the boxes as a result of Emily's $2017$th step? $\text{(A) }9\qquad\text{(B) }11\qquad\text{(C) }13\qquad\text{(D) }15\qquad\text{(E) }17$

The incircle of a non-isosceles triangle $ABC$ with the center $I$ touches the sides $BC$ at $D$. let $X$ is a point on arc $BC$ from circumcircle of triangle $ABC$ such that if $E,F$ are feet of perpendicular from $X$ on $BI,CI$ and $M$ is midpoint of $EF$ we have $MB=MC$. prove that $\widehat{BAD}=\widehat{CAX}$

Suppose $ \vartriangle ABC$ is similar to $\vartriangle DEF$, with $ A$, $ B$, and $C$ corresponding to $D, E$, and $F$ respectively. If $\overline{AB} = \overline{EF}$, $\overline{BC} = \overline{FD}$, and $\overline{CA} = \overline{DE} = 2$, determine the area of $ \vartriangle ABC$.

How many polynomials of the form $x^5 + ax^4 + bx^3 + cx^2 + dx + 2020$, where $a$, $b$, $c$, and $d$ are real numbers, have the property that whenever $r$ is a root, so is $\frac{-1+i\sqrt{3}}{2} \cdot r$? (Note that $i=\sqrt{-1}$) $\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 4$

Find all functions $f: R \rightarrow R$ such that $f(x^{2015} + (f(y))^{2015}) = (f(x))^{2015} + y^{2015}$ holds for all reals $x, y$

Let $n\in N$ $n\geq2$ and the set $X$ with $n+1$ elements. The ordered sequences $(a_{1}, a_{2},\ldots,a_{n})$ and $(b_{1},b_{2},\ldots b_{n})$ of distinct elements of $X$ are said to be $\textit{separated}$ if there exists $i\neq j$ such that $a_{i}=b_{j}$. Determine the maximal number of ordered sequences of $n$ elements from $X$ such that any two of them are $\textit{separated}$. Note: ordered means that, for example $(1,2,3)\neq(2,3,1)$.

Let $ AB$ be a diameter of a circle, $ C$ be any fixed point between $ A$ and $ B$ on this diameter, and $ Q$ be a variable point on the circumference of the circle. Let $ P$ be the point on the line determined by $ Q$ and $ C$ for which $ \frac{AC}{CB}\equal{}\frac{QC}{CP}$. Describe, with proof, the locus of the point $ P$.

Sum of the roots in the range $\left(-\frac{\pi}{2},\frac{\pi}{2} \right)$ of the equation $\sin x\tan x=x^2$ is [list=1] [*] $\frac{\pi}{2}$ [*] 0 [*] 1 [*] None of these [/list]

Isosceles trapezoid $ ABCD$, with $ AB \parallel CD$, is such that there exists a circle $ \Gamma$ tangent to its four sides. Let $ T \equal{} \Gamma \cap BC$, and $ P \equal{} \Gamma \cap AT$ ($ P \neq T$). If $ \frac{AP}{AT} \equal{} \frac{2}{5}$, compute $ \frac{AB}{CD}$.

Find all monic polynomials $f$ with integer coefficients satisfying the following condition: there exists a positive integer $N$ such that $p$ divides $2(f(p)!)+1$ for every prime $p>N$ for which $f(p)$ is a positive integer. [i]Note: A monic polynomial has a leading coefficient equal to 1.[/i] [i](Greece - Panagiotis Lolas and Silouanos Brazitikos)[/i]

How many nonzero coefficients can a polynomial $ P(x)$ have if its coefficients are integers and $ |P(z)| \le 2$ for any complex number $ z$ of unit length?

Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.

The triple bond in carbon monoxide consists of $ \textbf{(A) } \text{3 sigma bonds}\qquad$ $\textbf{(B) } \text{2 sigma bonds and 1 pi bond}\qquad$ $\textbf{(C) } \text{1 sigma bond and 2 pi bonds}\qquad$ $\textbf{(D) } \text{3 pi bonds}\qquad$

Let $p$ be an odd prime number. Prove that $$1^{p-1} + 2^{p-1} +...+ (p-1)^{p-1} \equiv p + (p-1)! \mod p^2$$

Consider a convex $2000$-gon, no three of whose diagonals have a common point. Each of its diagonals is colored in one of $999$ colors. Prove that there exists a triangle all of whose sides lie on diagonals of the same color. (Vertices of the triangle need not be vertices of the original polygon.)

Find all $f:\mathbb{R}\to\mathbb{R}$ such that for all $x,y\in\mathbb{R}$, $f(x)+f(y) = f(x+y)$ and $f(x^{2013}) = f(x)^{2013}$. [i]Proposed by Calvin Deng[/i]

Suppose $a$, $b$ and $c$ are integers such that the greatest common divisor of $x^2+ax+b$ and $x^2+bx+c$ is $x+1$ (in the set of polynomials in $x$ with integer coefficients), and the least common multiple of $x^2+ax+b$ and $x^2+bx+c$ $x^3-4x^2+x+6$. Find $a+b+c$.

Find the least positive integer $n$ so that both $n$ and $n+1$ have prime factorizations with exactly four (not necessarily distinct) prime factors.

We call an infinite set $S\subseteq\mathbb{N}$ good if for all parwise different integers $a,b,c\in S$, all positive divisors of $\frac{a^c-b^c}{a-b}$ are in $S$. for all positive integers $n>1$, prove that there exists a good set $S$ such that $n \not \in S$. Proposed by Seyed Reza Hosseini Dolatabadi