For a triangle $ ABC $, let $ B_1 ,C_1 $ be the excenters of $ B, C $. Line $B_1 C_1 $ meets with the circumcircle of $ \triangle ABC $ at point $ D (\ne A) $. $ E $ is the point which satisfies $ B_1 E \bot CA $ and $ C_1 E \bot AB $. Let $ w $ be the circumcircle of $ \triangle ADE $. The tangent to the circle $ w $ at $ D $ meets $ AE $ at $ F $. $ G , H $ are the points on $ AE, w $ such that $ DGH \bot AE $. The circumcircle of $ \triangle HGF $ meets $ w $ at point $ I ( \ne H ) $, and $ J $ be the foot of perpendicular from $ D $ to $ AH $. Prove that $ AI $ passes the midpoint of $ DJ $.

Let ABC be a triangle with$|AB|< |AC|. $ Let $k$ be the circumcircle of $\triangle ABC$ and let $O$ be the center of $k$. Point $M$ is the midpoint of the arc $BC $ of $k$ not containing $A$. Let $D $ be the second intersection of the perpendicular line from $M$ to $AB$ with $ k$ and $E$ be the second intersection of the perpendicular line from $M$ to $AC $ with $k$. Points $X $and $Y $ are the intersections of $CD$ and $BE$ with $OM$ respectively. Denote by $k_b$ and $k_c$ circumcircles of triangles $BDX$ and $CEY$ respectively. Let $G$ and $H$ be the second intersections of $k_b$ and $k_c $ with $AB$ and $AC$ respectively. Denote by ka the circumcircle of triangle $AGH.$ Prove that $O$ is the circumcenter of $\triangle O_aO_bO_c, $where $O_a, O_b, O_c $ are the centers of $k_a, k_b, k_c$ respectively.

Determine the number of $ 8$-tuples of nonnegative integers $ (a_1,a_2,a_3,a_4,b_1,b_2,b_3,b_4)$ satisfying $ 0\le a_k\le k$, for each $ k \equal{} 1,2,3,4$, and $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \plus{} 2b_1 \plus{} 3b_2 \plus{} 4b_3 \plus{} 5b_4 \equal{} 19$.

[b]3.[/b] Denoting by $E$ the class of trigonometric polynomials of the form $f(x)=c_{0}+c_{1}cos(x)+\dots +c_{n} cos(nx)$, where $c_{0} \geq c_{1} \geq \dots \geq c_{n}>0$, prove that $(1-\frac{2}{\pi})\frac{1}{n+1}\leq min_{{f\epsilon E}}( \frac{max_{\frac{\pi}{2}\leq x\leq \pi} \left | f(x) \right |}{max_{0\leq x\leq 2\pi} \left | f(x) \right |})\leq (\frac{1}{2}+\frac{1}{\sqrt{2}})\frac{1}{n+1}$. [b](S. 24)[/b]

Show that points $A, B, C$ and $D$ can be placed on the plane in such a way that the quadrilateral $ABCD$ has an area which is twice the area of the quadrilateral $ADBC.$

Show that for any four positive real numbers $ a,b,c,d $ and four negative real numbers $ e,f,g,h, $ the terms $ ae+bc,ef+cg,fd+gh,da+hb $ are not all positive.

A card deck consists of $1024$ cards. On each card, a set of distinct decimal digits is written in such a way that no two of these sets coincide (thus, one of the cards is empty). Two players alternately take cards from the deck, one card per turn. After the deck is empty, each player checks if he can throw out one of his cards so that each of the ten digits occurs on an even number of his remaining cards. If one player can do this but the other one cannot, the one who can is the winner; otherwise a draw is declared. Determine all possible first moves of the first player after which he has a winning strategy. [i]Proposed by Ilya Bogdanov & Vladimir Bragin, Russia[/i]

The director of a Zoo has bought eight elephants numbered by $1, 2, \ldots , 8$. He has forgotten their masses but he remembers that each elephant starting with the third one has the mass equal to the sum of the masses of two preceding ones. Suddenly the director hears a rumor that one of the elephants has lost his mass. How can the director perform two weightings on balancing scales without weights to either find this elephant or make sure that this was just a rumor? (It is known that no elephant gained mass and no more than one elephant lost mass.) [i]Alexandr Gribalko[/i]

For every natural number $n$, find all polynomials $x^2+ax+b$, where $a^2 \geq 4b$, that divide $x^{2n} + ax^n + b$.

In a $3$ by $3$ table, by a $k$-worm, we mean a path of different cells $(S_1,S_2,...,S_k)$ such that each two consecutive cells have one side in common. The $k$-worm at each steep can go one cell forward and turn to the $(S,S_1,...,S_{k-1})$ if $S$ is an unfilled cell which is adjacent (has one side in common) with $S_1$. Find the maximum number of $k$ such that there is a $k$-worm $(S_1,...,S_k)$ such that after finitly many steps can be turned to $(S_k,...,S_1)$.

There are positive integers $ a $, $ b $, $ c $, $ d $, $ e $, $ f $ such that $ a+b = c+d = e+f = 101 $. Prove that the number $ \frac{ace}{bdf} $ cannot be written as a fraction $ \frac{m}{n} $ where $ m $, $ n $ are positive integers with a sum less than $ 101 $.

A refrigerator is offered at sale at $ \$ 250.00$ less successive discounts of $ 20\%$ and $ 15\%$. The sale price of the refrigerator is: $ \textbf{(A)}\ 35\% \text{ less than } \$250.00 \qquad\textbf{(B)}\ 65\% \text{ of } \$250.00 \qquad\textbf{(C)}\ 77\% \text{ of } \$250.00 \qquad\textbf{(D)}\ 68\% \text{ of } \$250.00 \qquad\textbf{(E)}\ \text{none of these}$

In each square of a $2012\times 2012$ board there's a person. People are either honest, who always tell the truth, or liars, who always lie. At a given moment, each person makes the same statement: "In my row there are the same number of liars as in my column." Determine the minimum number of honest people that can be on the board.

One hundred musicians are planning to organize a festival with several concerts. In each concert, while some of the one hundred musicians play on stage, the others remain in the audience assisting to the players. What is the least number of concerts so that each of the musicians has the chance to listen to each and every one of the other musicians on stage?

Let $(a_{i,j})^n_{i,j=1}$ be a real matrix such that $a_{i,i}=0$ for $i=1,2,\ldots,n$. Prove that there exists a set $\mathcal J\subset\{1,2,\ldots,n\}$ of indices such that $$\sum_{\begin{smallmatrix}i\in\mathcal J\\j\notin\mathcal J\end{smallmatrix}}a_{i,j}+\sum_{\begin{smallmatrix}i\notin\mathcal J\\j\in\mathcal J\end{smallmatrix}}a_{i,j}\ge\frac12\sum_{i,j=1}^na_{i,j}.$$

A dragon gave a captured knight $100$ coins. Half of them are magical, but only dragon knows which are. Each day, the knight should divide the coins into two piles (not necessarily equal in size). The day when either magic coins or usual coins are spread equally between the piles, the dragon set the knight free. Can the knight guarantee himself a freedom in at most (a) $50$ days? (b) $25$ days?

Let $a_1, a_2, \ldots, a_{2016}$ be real numbers such that $9a_i\ge 11a^2_{i+1}$ $(i=,2,\cdots,2015)$. Find the maximum value of $(a_1-a^2_2)(a_2-a^2_3)\cdots (a_{2015}-a^2_{2016})(a_{2016}-a^2_{1}).$

If \[x \equal{} \frac { \minus{} 1 \plus{} i\sqrt3}{2}\qquad\text{and}\qquad y \equal{} \frac { \minus{} 1 \minus{} i\sqrt3}{2},\] where $ i^2 \equal{} \minus{} 1$, then which of the following is [i]not[/i] correct? $ \textbf{(A)}\ x^5 \plus{} y^5 \equal{} \minus{} 1 \qquad \textbf{(B)}\ x^7 \plus{} y^7 \equal{} \minus{} 1 \qquad \textbf{(C)}\ x^9 \plus{} y^9 \equal{} \minus{} 1$ $ \textbf{(D)}\ x^{11} \plus{} y^{11} \equal{} \minus{} 1 \qquad \textbf{(E)}\ x^{13} \plus{} y^{13} \equal{} \minus{} 1$

The natural numbers $k \geqslant n$ are given. Peter has $n{}$ objects and $N{}$ special ways in which he likes to lay them out in a row from left to right. He noticed that for any non-empty subset $A{}$ of these objects containing $|A| \leqslant k$ objects, and any element $a\in A$, there are exactly $N/|A|$ special ways for which element $a{}$ is the leftmost in the set $A{}$. Prove that, under the same conditions on $A{}$ and $a{}$, for any integer $m =1,2,\ldots,|A|$ there are exactly $N/|A|$ special ways for which the element $a{}$ is the $m^{\text{th}}$ from the left in the set $A{}$.

Determine the largest and smallest fractions $F = \frac{y-x}{x+4y}$ if the real numbers $x$ and $y$ satisfy the equation $x^2y^2 + xy + 1 = 3y^2$.

Lucky and Jinx were given a paper with $2023$ points arranged as the vertices of a regular polygon. They were then tasked to color all the segments connecting these points such that no triangle formed with these points has all edges in the same color, nor in three different colors and no quadrilateral (not necessarily convex) has all edges in the same color. After the coloring it was determined that Jinx used at least two more colors than Lucky. How many colors did each of them use? [i]Authored by Ilija Jovcheski[/i]

Call a number [i]orz[/i] if it is a positive integer less than $2024$. Call a number [i]admitting[/i] if it can be expressed as $a^2-1$ where $a$ is a positive integer. Finally call a number [i]muztaba[/i] if it has exactly $4$ positive integer factors. Find the number of [i]muztaba admitting orz[/i] numbers.

There are $n$ students each having $r$ positive integers. Their $nr$ positive integers are all different. Prove that we can divide the students into $k$ classes satisfying the following conditions. (a) $ k \le 4r $ (b) If a student $A$ has the number $m$, then the student $B$ in the same class can't have a number $l$ such that \[ (m-1)! < l < (m+1)!+1 \]

Let $n\geq 3$ be an integer. Each vertex of a regular $n$-gon is labelled with a real number not exceeding $1$. For real numbers $a,b,c$ on any three consecutive vertices which are arranged clockwise in such an order, we have $c=|a-b|$. Determine the maximum value of the sum of all numbers in terms of $n$.

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.