Let $O$ be the circumcenter of an acute triangle $ABC$. Let $D$ be the intersection of the bisector of the angle $A$ and $BC$. Suppose that $\angle ODC = 2 \angle DAO$. The circumcircle of $ABD$ meets the line segment $OA$ and the line $OD$ at $E (\neq A,O)$, and $F(\neq D)$, respectively. Let $X$ be the intersection of the line $DE$ and the line segment $AC$. Let $Y$ be the intersection of the bisector of the angle $BAF$ and the segment $BE$. Prove that $\frac{\overline{AY}}{\overline{BY}}= \frac{\overline{EX}}{\overline{EO}}$.

One day students in school organised a exchange between them such that : $11$ strawberries change for $14$ raspberries, $22$ cherries change for $21$ raspberries, $10$ cherries change for $3$ bananas and $5$ pears for $2$ bananas. How many pears has Amila to give to get $7$ strawberries

Consider a triangle $ABC$ with $BC = 3$. Choose a point $D$ on $BC$ such that $BD = 2$. Find the value of \[AB^2 + 2AC^2 - 3AD^2.\]

Nicu plays the Next game on the computer. Initially the number $S$ in the computer has the value $S = 0$. At each step Nicu chooses a certain number $a$ ($0 <a <1$) and enters it in computer. The computer arbitrarily either adds this number $a$ to the number $S$ or it subtracts from $S$ and displays on the screen the new result for $S$. After that Nicu does Next step. It is known that among any $100$ consecutive operations the computer the at least once apply the assembly. Give an arbitrary number $M> 0$. Show that there is a strategy for Nicu that will always allow him after a finite number of steps to get a result $S> M$. [hide=original wording]Nicu joacă la calculator următorul joc. Iniţial numărul S din calculator are valoarea S = 0. La fiecare pas Nicu alege un număr oarecare a (0 < a < 1) şi îl introduce în calculator. Calculatorul, în mod arbitrar, sau adună acest număr a la numărul S sau îl scade din S şi afişează pe ecran rezultatul nou pentru S. După aceasta Nicu face următorul pas. Se ştie că printre oricare 100 de operaţii consecutive calculatorul cel puţin o dată aplică adunarea. Fie dat un număr arbitrar M > 0. Să se arate că există o strategie pentru Nicu care oricând îi va permite lui după un număr finit de paşi să obţină un rezulat S > M.[/hide]

There are $N$ piles each consisting of a single nut. Two players in turns play the following game. At each move, a player combines two piles that contain coprime numbers of nuts into a new pile. A player who can not make a move, loses. For every $N > 2$ determine which of the players, the first or the second, has a winning strategy.

Find all prime numbers that do not have a multiple ending in $2015$.

Two positive integers are written on the blackboard. Initially, one of them is $2000$ and the other is smaller than $2000$. If the arithmetic mean $ m$ of the two numbers on the blackboard is an integer, the following operation is allowed: one of the two numbers is erased and replaced by $ m$. Prove that this operation cannot be performed more than ten times. Give an example where the operation is performed ten times.

Fix a positive integer $n\geq 2$. What is the lest value that the expression $$\bigg\lfloor\frac{x_2+x_3+\dots +x_n}{x_1}\bigg\rfloor + \bigg\lfloor\frac{x_1+x_3+\dots +x_n}{x_2}\bigg\rfloor +\dots +\bigg\lfloor\frac{x_1+x_2+\dots +x_{n-1}}{x_n}\bigg\rfloor$$ may achieve, where $x_1,x_2,\dots ,x_n$ are positive real numbers.

On Halloween 31 children walked into the principal's office asking for candy. They can be classified into three types: Some always lie; some always tell the truth; and some alternately lie and tell the truth. The alternaters arbitrarily choose their first response, either a lie or the truth, but each subsequent statement has the opposite truth value from its predecessor. The principal asked everyone the same three questions in this order. "Are you a truth-teller?" The principal gave a piece of candy to each of the 22 children who answered yes. "Are you an alternater?" The principal gave a piece of candy to each of the 15 children who answered yes. "Are you a liar?" The principal gave a piece of candy to each of the 9 children who answered yes. How many pieces of candy in all did the principal give to the children who always tell the truth? $\textbf{(A) }7\qquad\textbf{(B) }12\qquad\textbf{(C) }21\qquad\textbf{(D) }27\qquad\textbf{(E) }31$

[b]p1.[/b] In triangle $ABC$, the median $BM$ is drawn. The length $|BM| = |AB|/2$. The angle $\angle ABM = 50^o$. Find the angle $\angle ABC$. [b]p2.[/b] Is there a positive integer $n$ which is divisible by each of $1, 2,3,..., 2018$ except for two numbers whose difference is$ 7$? [b]p3.[/b] Twenty numbers are placed around the circle in such a way that any number is the average of its two neighbors. Prove that all of the numbers are equal. [b]p4.[/b] A finite number of frogs occupy distinct integer points on the real line. At each turn, a single frog jumps by $1$ to the right so that all frogs again occupy distinct points. For some initial configuration, the frogs can make $n$ moves in $m$ ways. Prove that if they jump by $1$ to the left (instead of right) then the number of ways to make $n$ moves is also $m$. [b]p5.[/b] A square box of chocolates is divided into $49$ equal square cells, each containing either dark or white chocolate. At each move Alex eats two chocolates of the same kind if they are in adjacent cells (sharing a side or a vertex). What is the maximal number of chocolates Alex can eat regardless of distribution of chocolates in the box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the real numbers $x$, $y$, $z > 0$ for which $xyz \leq \min\left\{4(x - \frac{1}{y}), 4(y - \frac{1}{z}), 4(z - \frac{1}{x})\right\}$

Given that $\sqrt{10} \approx 3.16227766$, find the largest integer $n$ such that $n^2 \leq 10,000,000$. [i]Proposed by Jacob Stavrianos[/i]

A rectangle is partitioned into finitely many small rectangles. We call a point a cross point if it belongs to four different small rectangles. We call a segment on the obtained diagram maximal if there is no other segment containing it. Show that the number of maximal segments plus the number of cross points is $3$ more than the number of small rectangles.

Let $ABC$ be an acute triangle. Let $P$ be a point such that $PB$ and $PC$ are tangent to circumcircle of $ABC$. Let $X$ and $Y$ be variable points on $AB$ and $AC$, respectively, such that $\angle XPY = 2\angle BAC$ and $P$ lies in the interior of triangle $AXY$. Let $Z$ be the reflection of $A$ across $XY$. Prove that the circumcircle of $XYZ$ passes through a fixed point. (Dominik Burek, Poland)

As shown in figure , in the pentagon $ABCDE$, $BC = DE$, $CD \parallel BE$, $AB>AE$. If $\angle BAC = \angle DAE$ and $\frac{AB}{BD}=\frac{AE}{ED}$. Prove that $AC$ bisects the line segment $BE$. [img]https://cdn.artofproblemsolving.com/attachments/3/2/5ce44f1e091786b865ae4319bda56c3ddbb8d7.png[/img]

In triangle $\triangle ABC$, let $E$ and $F$ be points on sides $AC$ and $AB$, respectively, such that $BFEC$ is cyclic. Let lines $BE$ and $CF$ intersect at point $P$, and $M$ and $N$ be the midpoints of $\overline{BF}$ and $\overline{CE}$, respectively. If $U$ is the foot of the perpendicular from $P$ to $BC$, and the circumcircles of triangles $\triangle BMU$ and $\triangle CNU$ intersect at second point $V$ different from $U$, prove that $A, P,$ and $V$ are collinear. [i]Proposed by Andrew Wen and William Yue[/i]