Let $\triangle ABC$ have $AB=3$, $AC=5$, and $\angle A=90^\circ$. Point $D$ is the foot of the altitude from $A$ to $\overline{BC}$, and $X$ and $Y$ are the feet of the altitudes from $D$ to $\overline{AB}$ and $\overline{AC}$ respectively. If $XY^2$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers, what is $100m+n$? [i] Proposed by David Altizio [/i]

Let the triangle $ABC$ have area $1$. The interior bisectors of the angles $\angle BAC,\angle ABC, \angle BCA$ intersect the sides $(BC), (AC), (AB) $ and the circumscribed circle of the respective triangle $ABC$ at the points $L$ and $G, N$ and $F, Q$ and $E$. The lines $EF, FG,GE$ intersect the bisectors $(AL), (CQ) ,(BN)$ respectively at points $P, M, R$. Determine the area of the hexagon $LMNPR$.

Let $M$ be a point in the interior of triangle $ABC$. Let $A'$ lie on $BC$ with $MA'$ perpendicular to $BC$. Define $B'$ on $CA$ and $C'$ on $AB$ similarly. Define \[ p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}. \] Determine, with proof, the location of $M$ such that $p(M)$ is maximal. Let $\mu(ABC)$ denote this maximum value. For which triangles $ABC$ is the value of $\mu(ABC)$ maximal?

$n^2$ real numbers are written in a square $n \times n$ table so that the sum of the numbers in each row and column equals zero. A move is to add a row to one column and subtract it from another (so if the entries are $a_{ij}$ and we select row $i$, column $h$ and column $k$, then column h becomes $a_{1h} + a_{i1}, a_{2h} + a_{i2}, ... , a_{nh} + a_{in}$, column $k$ becomes $a_{1k} - a_{i1}, a_{2k} - a_{i2}, ... , a_{nk} - a_{in}$, and the other entries are unchanged). Show that we can make all the entries zero by a series of moves.

To obtain the value of a polynomial of degree $n$, whose coefficients are $$a_0, a_1, . . . ,a_n$$ (starting with the term of highest degree), when the variable $x$ is given the value $b$, the process indicated in the attached flowchart can be applied, which develops the actions required to apply Ruffini's rule. It is requested to build another flowchart analogous that allows to express the calculation of the value of the derivative of the given polynomial, also for $x = b$. [img]https://cdn.artofproblemsolving.com/attachments/a/a/27563a0e97e74553a270fcd743f22176aed83b.png[/img]

Given an inscribed quadrilateral $ABCD$, which marked the midpoints of the points $M, N, P, Q$ in this order. Let diagonals $AC$ and $BD$ intersect at point $O$. Prove that the triangle $OMN, ONP, OPQ, OQM$ have the same radius of the circles

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In the triangle $ABC$ we have $\angle ABC=100^\circ$, $\angle ACB=65^\circ$, $M\in AB$, $N\in AC$, and $\angle MCB=55^\circ$, $\angle NBC=80^\circ$. Find $\angle NMC$. [i]St.Petersburg folklore[/i]

There are six empty purses on the table. How many ways are there to put 12 two-euro coins in purses in such a way that at most one purse remains empty?

Chandler wants to buy a $\$500$ dollar mountain bike. For his birthday, his grandparents send him $\$50$, his aunt sends him $\$35$ and his cousin gives him $\$15$. He earns $\$16$ per week for his paper route. He will use all of his birthday money and all of the money he earns from his paper route. In how many weeks will he be able to buy the mountain bike? $\textbf{(A)}\ 24 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 26 \qquad \textbf{(D)}\ 27 \qquad \textbf{(E)}\ 28$

Is it possible to cover an $n \times n$ chessboard which has its center square cut out with tiles shown in the picture (each tile covers exactly $4$ squares, tiles can be rotated and turned around) if a) $n = 5$, b) $n = 2003$? [img]https://cdn.artofproblemsolving.com/attachments/6/5/8fddeefc226ee0c02353a1fc11e48ce42d8436.png[/img]

Consider the triangle $ ABC$ with side-lenghts equal to $ a,b,c$. Let $ p\equal{}\frac{a\plus{}b\plus{}c}{2}$, $ R$-the radius of circumcircle of the triangle $ ABC$, $ r$-the radius of the incircle of the triangle $ ABC$ and let $ l_a,l_b,l_c$ be the lenghts of bisectors drawn from $ A,B$ and $ C$, respectively, in the triangle $ ABC$. Prove that: $ l_al_b\plus{}l_bl_c\plus{}l_cl_a\leq p\sqrt{3r^2\plus{}12Rr}$ [i]Proposer[/i]: [b]Baltag Valeriu[/b]

A number of $n$ lamps ($n\ge 3$) are put at $n$ vertices of a regular $n$-gon. Initially, all the lamps are off. In each step. Lisa will choose three lamps that are located at three vertices of an isosceles triangle and change their states (from off to on and vice versa). Her aim is to turn on all the lamps. At least how many steps are required to do so?

Circles $A, B,$ and $C$ each have radius 1. Circles $A$ and $B$ share one point of tangency. Circle $C$ has a point of tangency with the midpoint of $\overline{AB}$. What is the area inside Circle $C$ but outside circle $A$ and circle $B$ ? [asy] pathpen = linewidth(.7); pointpen = black; pair A=(-1,0), B=-A, C=(0,1); fill(arc(C,1,0,180)--arc(A,1,90,0)--arc(B,1,180,90)--cycle, gray(0.5)); D(CR(D("A",A,SW),1)); D(CR(D("B",B,SE),1)); D(CR(D("C",C,N),1));[/asy] ${ \textbf{(A)}\ 3 - \frac{\pi}{2} \qquad \textbf{(B)}\ \frac{\pi}{2} \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ \frac{3\pi}{4} \qquad \textbf{(E)}\ 1+\frac{\pi}{2}} $

Find all $C\in \mathbb{R}$ such that every sequence of integers $\{a_n\}_{n=1}^{\infty}$ which is bounded from below and for all $n\geq 2$ satisfy $$0\leq a_{n-1}+Ca_n+a_{n+1}<1$$ is periodic. Proposed by Navid Safaei

Construct the $ \triangle ABC$, given $ h_a$, $ h_b$ (the altitudes from $ A$ and $ B$) and $ m_a$, the median from the vertex $ A$.