A non-isosceles triangle $\triangle ABC$ has its incircle tangent to $BC, CA, AB$ at points $D, E, F$. Let the incenter be $I$. Say $AD$ hits the incircle again at $G$, at let the tangent to the incircle at $G$ hit $AC$ at $H$. Let $IH \cap AD = K$, and let the foot of the perpendicular from $I$ to $AD$ be $L$. Prove that $IE \cdot IK= IC \cdot IL$.

For $ t \equal{} 1, 2, 3, 4$, define $ \displaystyle S_t \equal{} \sum_{i \equal{} 1}^{350}a_i^t$, where $ a_i \in \{1,2,3,4\}$. If $ S_1 \equal{} 513$ and $ S_4 \equal{} 4745$, find the minimum possible value for $ S_2$.

The relation $ x^2(x^2 \minus{} 1)\ge 0$ is true only for: $ \textbf{(A)}\ x \ge 1\qquad \textbf{(B)}\ \minus{} 1 \le x \le 1\qquad \textbf{(C)}\ x \equal{} 0,\, x \equal{} 1,\, x \equal{} \minus{} 1\qquad \\\textbf{(D)}\ x \equal{} 0,\, x \le \minus{} 1,\, x \ge 1\qquad \textbf{(E)}\ x \ge 0$

Given an acute triangle $ABC$ with $AB>AC$ that has circumcenter $O$. Line $BO$ and $CO$ meet the bisector of $\angle BAC$ at $P$ and $Q$, respectively. Moreover, line $BQ$ and $CP$ meet at $R$. Show that $AR$ is perpendicular to $BC$. [i]Proposer: Soewono and Fajar Yuliawan[/i]

Three students $A, B$ and $C$ are traveling from a location on the National Highway No.$5$ on direction to Hanoi for participating the HOMC $2018$. At beginning, $A$ takes $B$ on the motocycle, and at the same time $C$ rides the bicycle. After one hour and a half, $B$ switches to a bicycle and immediately continues the trip to Hanoi, while $A$ returns to pick up $C$. Upon meeting, $C$ continues the travel on the motocycle to Hanoi with $A$. Finally, all three students arrive in Hanoi at the same time. Suppose that the average speed of the motocycle is $50$ km per hour and of the both bicycles are $10$ km per hour. Find the distance from the starting point to Hanoi.

What is the maximum number of checkers it is possible to put on a $ n \times n$ chessboard such that in every row and in every column there is an even number of checkers?

For an odd number n, we write $n!! = n\cdot (n-2)...3 \cdot 1$. How many different residues modulo $1000$ do you get from $n!!$ for $n= 1, 3, 5, …$?

Let $ f(x) = x^3 + ax + b $, with $ a \ne b $, and suppose the tangent lines to the graph of $f$ at $x=a$ and $x=b$ are parallel. Find $f(1)$.

Prove that for arbitary positive integer $ n\geq 4$, there exists a permutation of the subsets that contain at least two elements of the set $ G_{n} \equal{} \{1,2,3,\cdots,n\}$: $ P_{1},P_{2},\cdots,P_{2^n \minus{} n \minus{} 1}$ such that $ |P_{i}\cap P_{i \plus{} 1}| \equal{} 2,i \equal{} 1,2,\cdots,2^n \minus{} n \minus{} 2.$

Find the shortest distance between the points $(3,5)$ and $(7,8)$.

Find the number of ways to color $n \times m$ board with white and black colors such that any $2 \times 2$ square contains the same number of black and white cells.

$a,b,c$ are positive real numbers. prove the following inequality: $\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}+\frac{1}{(a+b+c)^2}\ge \frac{7}{25}(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{a+b+c})^2$ (20 points)

Let $S$ be the set of $2\times2$-matrices over $\mathbb{F}_{p}$ with trace $1$ and determinant $0$. Determine $|S|$.

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

Let $ABC$ be a triangle with $AB=10$, $AC=11$, and circumradius $6$. Points $D$ and $E$ are located on the circumcircle of $\triangle ABC$ such that $\triangle ADE$ is equilateral. Line segments $\overline{DE}$ and $\overline{BC}$ intersect at $X$. Find $\tfrac{BX}{XC}$.

Given any six points in the plane, no three collinear, show that we can always find three which form an obtuse-angled triangle with one angle at least $120^o$.

Let $ABC$ be a triangle, $O$ is the center of the circle circumscribed around it, $AD$ the diameter of this circle. It is known that the lines $CO$ and $DB$ are parallel. Prove that the triangle $ABC$ is isosceles. (Andrey Mostovy)

Let $f$ be a function $f: \mathbb{N} \cup \{0\} \mapsto \mathbb{N},$ and satisfies the following conditions: (1) $f(0) = 0, f(1) = 1,$ (2) $f(n+2) = 23 \cdot f(n+1) + f(n), n = 0,1, \ldots.$ Prove that for any $m \in \mathbb{N}$, there exist a $d \in \mathbb{N}$ such that $m | f(f(n)) \Leftrightarrow d | n.$

Let $M$ be inside segment $BC$ in triangle $\triangle ABC$. $(ABM)$ cuts $AC$ in $A$ and $N$. Construct the circle through $A,N$ and tangent to $BC$ in $P$. Prove that $\measuredangle BAP=\measuredangle PNM$.

Is it possible to arrange all the integers from $0$ to $9$ in circles so that the sum of three numbers along any of the six segments is the same? [img]https://cdn.artofproblemsolving.com/attachments/c/1/1a577fb4a607c395f5cc07b63653307b569b95.png[/img]

We say that a number $n \ge 2$ has the property $(P)$ if, in its prime factorization, at least one of the factors has an exponent $3$. a) Determine the smallest number $N$ with the property that, no matter how we choose $N$ consecutive natural numbers, at least one of them has the property $(P).$ b) Determine the smallest $15$ consecutive numbers $a_1, a_2, \ldots, a_{15}$ that do not have the property $(P),$ such that the sum of the numbers $5 a_1, 5 a_2, \ldots, 5 a_{15}$ is a number with the property $(P).$

A teacher plays the game “Duck-Goose-Goose” with his class. The game is played as follows: All the students stand in a circle and the teacher walks around the circle. As he passes each student, he taps the student on the head and declares her a ‘duck’ or a ‘goose’. Any student named a ‘goose’ leaves the circle immediately. Starting with the first student, the teacher tags students in the pattern: duck, goose, goose, duck, goose, goose, etc., and continues around the circle (re-tagging some former ducks as geese) until only one student remains. This remaining student is the winner. For instance, if there are 8 students, the game proceeds as follows: student 1 (duck), student 2 (goose), student 3 (goose), student 4 (duck), student 5 (goose), student 6 (goose), student 7 (duck), student 8 (goose), student 1 (goose), student 4 (duck), student 7 (goose) and student 4 is the winner. Find, with proof, all values of $n$ with $n>2$ such that if the circle starts with $n$ students, then the $n$th student is the winner.

Let $a,b,c,d$ be non-negative integers. $(1)$ If $a^2+b^2-cd^2=2022 ,$ find the minimum of $a+b+c+d;$ $(1)$ If $a^2-b^2+cd^2=2022 ,$ find the minimum of $a+b+c+d .$

Five girls and five boys randomly sit in ten seats that are equally spaced around a circle. The probability that there is at least one diameter of the circle with two girls sitting on opposite ends of the diameter is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Let the sequence $ \{a_n\}_{n\geq 1}$ be defined by $ a_1 \equal{} 20$, $ a_2 \equal{} 30$ and $ a_{n \plus{} 2} \equal{} 3a_{n \plus{} 1} \minus{} a_n$ for all $ n\geq 1$. Find all positive integers $ n$ such that $ 1 \plus{} 5a_n a_{n \plus{} 1}$ is a perfect square.