In triangle $ABC$, $AL$ bisects angle $A$ and $CM$ bisects angle $C$. Points $L$ and $M$ are on $BC$ and $AB$, respectively. The sides of triangle $ABC$ are $a,b,$ and $c$. Then $\frac{\overline{AM}}{\overline{MB}}=k\frac{\overline{CL}}{\overline{LB}}$ where $k$ is: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac{bc}{a^2}\qquad\textbf{(C)}\ \frac{a^2}{bc}\qquad\textbf{(D)}\ \frac{c}{b}\qquad\textbf{(E)}\ \frac{c}{a} $

Find all pairs of positive integers $x,y$ such that $\frac{4}{x}+\frac{2}{y}=1$

Let $ABCD$ be a parallelogram such that $|AB| > |BC|$. Let $O$ be a point on the line $CD$ such that $|OB| = |OD|$. Let $\omega$ be a circle with center $O$ and radius $|OC|$. If $T$ is the second intersection of $\omega$ and $CD$, prove that $AT, BO$ and $\omega$ are concurrent. [i]Proposed by Ivan Novak[/i]

Strings $a_1, a_2, ... , a_{2016}$ and $b_1, b_2, ... , b_{2016}$ each contain all natural numbers from $1$ to $2016$ exactly once each (in other words, they are both permutations of the numbers $1, 2, ..., 2016$). Prove that different indices $i$ and $j$ can be found such that $a_ib_i- a_jb_j$ is divisible by $2017$.

For any sequence ($a_1,a_2,...,a_{2013}$) of integers, we call a triple ($i,j, k$) satisfying $1 \le i < j < k \le 2013$ to be [i]progressive [/i] if $a_k-a_j = a_j -a_i = 1$. Determine the maximum number of progressive triples that a sequence of $2013$ integers could have.

Find the value of $645$. [i]Proposed by George Xing, et al.[/i]

$(HUN 3)$ In the plane $4000$ points are given such that each line passes through at most $2$ of these points. Prove that there exist $1000$ disjoint quadrilaterals in the plane with vertices at these points.

Real numbers $x_1, x_2, x_3, x_4$ are roots of the fourth degree polynomial $W (x)$ with integer coefficients. Prove that if $x_3 + x_4$ is a rational number and $x_3x_4$ is a irrational number, then $x_1 + x_2 = x_3 + x_4$.

Given a cube and two colours. Two players paint in turn a triple of arbitrary unpainted edges with his colour. (Everyone makes two moves.) The first wins if he has painted all the edges of some face with his colour. Can he always win?

In $\triangle ABC$, $AC>BC$, $CM$ is the median, and $CH$ is the altitude emanating from $C$, as shown in the figure on the right. Determine the measure of $\angle MCH$ if $\angle ACM$ and $\angle BCH$ each have measure $17^\circ$. [asy] size(200); defaultpen(linewidth(0.8)); pair A=origin,B=(10,0),C=(7,5),M=(5,0),H=(7,0); draw(A--C--B--cycle^^H--C--M); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,NE); label("$M$",M,NW); label("$H$",H,NE); [/asy]

The number $201212200619$ has a factor $m$ such that $6 \cdot 10^9 <m <6.5 \cdot 10^9$. Find $m$.

[u]Round 1[/u] [b]p1.[/b] Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart. The bears in the red and blue shirts each make one true statement and one false statement. The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.” The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.” Help Goldilocks find out which bear is wearing which shirt. [b]p2.[/b] The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom. It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even? [b]p3.[/b] The $99$ greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the $99$ scientists will be waving, no matter how they are seated around the table. [b]p4.[/b] One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line. [b]p5.[/b] To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for $24$ hours straight. A different story will be read each hour for a total of $12$ Star Wars stories and $12$ Star Trek stories. George and Gene want to listen to exactly $6$ Star Wars and $6$ Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of $12$ consecutive hours to listen to the stories together. [u]Round 2[/u] [b]p6.[/b] $2013$ people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after $2013$ minutes? [b]p7.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all real solutions to the equation $$\lfloor x \rfloor ^2 + \lfloor x \rfloor= x^2-\frac14.$$

In the game of Ric-Rac-Roe, two players take turns coloring squares of a $3 \times 3$ grid in their color; a player wins if they complete a row or column of their color on their turn. If Alice and Bob play this game, picking an uncolored square uniformly at random on their turn, what is the probability that they tie?

Let’s note the set of all integers $n>1$ which are not divisible by a square of a prime number. We define the number $f(n)$ as the greatest amount of divisors of $n$ which could be chosen in such way so that for each two chosen $a$ and $b$, not necessarily different, the number $a^2+ab+b^2+n$ is not a square. Find all $m$ for which there exists $n$ so that $f(n)=m$.

Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.

How many of the first ten numbers of the sequence $121$, $11211$, $1112111$, ... are prime numbers? $\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$

The sum $$\sum_{k=3}^{\infty} \frac{1}{k(k^4-5k^2+4)^2}$$ is equal to $\frac{m^2}{2n^2}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

Each of the points $A$, $B$, $C$, $D$, $E$, and $F$ in the figure below represent a different digit from 1 to 6. Each of the five lines shown passes through some of these points. The digits along the line each are added to produce 5 sums, one for each line. The total of the sums is $47$. What is the digit represented by $B$? [asy] size(200); dotfactor = 10; pair p1 = (-28,0); pair p2 = (-111,213); draw(p1--p2,linewidth(1)); pair p3 = (-160,0); pair p4 = (-244,213); draw(p3--p4,linewidth(1)); pair p5 = (-316,0); pair p6 = (-67,213); draw(p5--p6,linewidth(1)); pair p7 = (0, 68); pair p8 = (-350,10); draw(p7--p8,linewidth(1)); pair p9 = (0, 150); pair p10 = (-350, 62); draw(p9--p10,linewidth(1)); pair A = intersectionpoint(p1--p2, p5--p6); dot("$A$", A, 2*W); pair B = intersectionpoint(p5--p6, p3--p4); dot("$B$", B, 2*WNW); pair C = intersectionpoint(p7--p8, p5--p6); dot("$C$", C, 1.5*NW); pair D = intersectionpoint(p3--p4, p7--p8); dot("$D$", D, 2*NNE); pair EE = intersectionpoint(p1--p2, p7--p8); dot("$E$", EE, 2*NNE); pair F = intersectionpoint(p1--p2, p9--p10); dot("$F$", F, 2*NNE); [/asy] $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $A$ be a set of numbers chosen from $1,2,..., 2015$ with the property that any two distinct numbers, say $x$ and $y$, in $A$ determine a unique isosceles triangle (which is non equilateral) whose sides are of length $x$ or $y$. What is the largest possible size of $A$?

Let $\triangle ABC$ be a acute triangle. Let $H$ the foot of the C-altitude in $AB$ such that $AH=3BH$, let $M$ and $N$ the midpoints of $AB$ and $AC$ and let $P$ be a point such that $NP=NC$ and $CP=CB$ and $B$, $P$ are located on different sides of the line $AC$. Prove that $\measuredangle APM=\measuredangle PBA$.

Prove that the circumcircle of a triangle contains exactly 3 points whose Simson lines are tangent to the triangle's Euler circle and these points are the vertices of an equilateral triangle.

What is the $100^\text{th}$ digit to the right of the decimal point in the decimal form of $4/37$? $\text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 2 \qquad \text{(D)}\ 7 \qquad \text{(E)}\ 8$

In $\triangle ABC$ with incenter $I$, $AB = 61$, $AC = 51$, and $BC=71$. The circumcircles of triangles $AIB$ and $AIC$ meet line $BC$ at points $D$ ($D \neq B$) and $E$ ($E \neq C$), respectively. Determine the length of segment $DE$. [i]James Tao[/i]