Suppose Alan, Michael, Kevin, Igor, and Big Rahul are in a running race. It is given that exactly one pair of people tie (for example, two people both get second place), so that no other pair of people end in the same position. Each competitor has equal skill; this means that each outcome of the race, given that exactly two people tie, is equally likely. The probability that Big Rahul gets first place (either by himself or he ties for first) can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.

The diagonals of a trapezoid $ ABCD$ intersect at point $ P$. Point $ Q$ lies between the parallel lines $ BC$ and $ AD$ such that $ \angle AQD \equal{} \angle CQB$, and line $ CD$ separates points $ P$ and $ Q$. Prove that $ \angle BQP \equal{} \angle DAQ$. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

$ABC$ is a triangle. Points $D, E, F$ are chosen on $BC, CA, AB$ such that $B$ is equidistant from $D$ and $F$, and $C$ is equidistant from $D$ and $E$. Show that the circumcenter of $AEF$ lies on the bisector of $EDF$.

Let $O$, $I$, and $\omega$ be the circumcenter, the incenter, and the incircle of nonequilateral $\triangle ABC$. Let $\omega_A$ be the unique circle tangent to $AB$ and $AC$, such that the common chord of $\omega_A$ and $\omega$ passes through the center of $\omega_A$ . Let $O_A$ be the center of $\omega_A$. Define $\omega_B, O_B, \omega_C, O_C$ similarly. If $\omega$ touches $BC$, $CA$, $AB$ at $D$, $E$, $F$ respectively, prove that the perpendiculars from $D$, $E$, $F$ to $O_BO_C , O_CO_A , O_AO_B$ are concurrent on the line $OI$. [i]Pitchayut Saengrungkongka[/i]

$f: \mathbb R\longrightarrow\mathbb R^{+}$ is a non-decreasing function. Prove that there is a point $a\in\mathbb R$ that \[f(a+\frac1{f(a)})<2f(a)\]

Eli, Joy, Paul, and Sam want to form a company; the company will have 16 shares to split among the $4$ people. The following constraints are imposed: $\bullet$ Every person must get a positive integer number of shares, and all $16$ shares must be given out. $\bullet$ No one person can have more shares than the other three people combined. Assuming that shares are indistinguishable, but people are distinguishable, in how many ways can the shares be given out?

11 integers are placed along the circle. It is known that any two neighbors differ by at least 20 and sum of any two neighbors is no more than 100. Find the minimal possible sum of all numbers.

Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying \begin{align*} f(x+f(y)) &= g(x) + h(y) \\ g(x+g(y)) &= h(x) + f(y) \\ h(x+h(y)) &= f(x) + g(y) \end{align*} for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.) [i]Proposed by Evan Chen[/i]

[b]Q.[/b] Consider in the plane $n>3$ different points. These have the properties, that all $3$ points can be included in a triangle with maximum area $1$. Prove that all the $n>3$ points can be included in a triangle with maximum area $4$. [i]Proposed by TuZo[/i]

Find the smallest positive integer $n$ with the following property: for every sequence of positive integers $a_1,a_2,\ldots , a_n$ with $a_1+a_2+\ldots +a_n=2013$, there exist some (possibly one) consecutive term(s) in the sequence that add up to $70$.

Denote the three real roots of the cubic $ x^3 \minus{} 3x \minus{} 1 \equal{} 0$ by $ x_1$, $ x_2$, $ x_3$ in order of increasing magnitude. (You may assume that the equation in fact has three distinct real roots.) Prove that $ x_3^2 \minus{} x_2^2 \equal{} x_3 \minus{} x_1$.

In a country with $ n $ ($ n \geq 3 $) airports, the government only licenses air travel to those airlines whose airline system meets the following conditions: a) Each airline must connect any two airports with one and only one one-way airline; b) For each airline there is an airport from which the passenger could fly off and fly back, using the services of only this airline. What is the maximum number of airlines with different airline systems?

Find all functions $f: \mathbb{Z} \to \mathbb{Z}$ such that \[ f(x) + f(y - 1) + f(f(y - f(x))) = 1 \] for all integers $x$ and $y$.

There are two piles of cards, one with $n$ cards and the other with $m$ cards. $A$ and $B$ play alternately, performing one of the following actions in each turn. following operations: a) Remove a card from a pile. b) Remove one card from each pile. c) Move a card from one pile to the other. Player $A$ always starts the game and whoever takes the last one letter wins . Determine if there is a winning strategy based on $m$ and $n$, so that one of the players following her can win always.

Let $ABC$ be a triangle. Let $B'$ be the symmetric of $B$ with respect to $C, C'$ the symmetry of $C$ with respect to $A$ and $A'$ the symmetry of $A$ with respect to $B$. a) Prove that the area of triangle $AC'A'$ is twice the area of triangle $ABC$. b) If we delete points $A, B, C$, how can they be reconstituted? Justify your reasoning.

Point $M$ is an arbitrary point in the plane and let points $G$ and $H$ be the intersection points of the tangents from point M and the circle $k$. Let $O$ be the center of the circle $k$ and let $K$ be the orthocenter of the triangle $MGH$. Prove that ${\angle}GMH={\angle}OGK$.

Let $x$ be a real number such that $$4^{2x}+2^{-x}+1=(129+8\sqrt2)(4^{x}+2^{-x}-2^{x}).$$ Find $10x$.

For $a>0$, find the minimum value of $I(a)=\int_1^e |\ln ax|\ dx.$

A drunken person walks randomly on a tree. Each time, he chooses uniformly at random a neighbouring node and walks there. Show that wherever his starting point and goal are, the expected number of steps the person takes to reach the goal is always an integer. [i]houkai[/i]

Find the sum of all integers from 1 to 1000 which contain at least one “7” in their digits.

Consider an acute-angled triangle $ABC$ with $AB<AC$ and let $\omega$ be its circumscribed circle. Let $t_B$ and $t_C$ be the tangents to the circle $\omega$ at points $B$ and $C$, respectively, and let $L$ be their intersection. The straight line passing through the point $B$ and parallel to $AC$ intersects $t_C$ in point $D$. The straight line passing through the point $C$ and parallel to $AB$ intersects $t_B$ in point $E$. The circumcircle of the triangle $BDC$ intersects $AC$ in $T$, where $T$ is located between $A$ and $C$. The circumcircle of the triangle $BEC$ intersects the line $AB$ (or its extension) in $S$, where $B$ is located between $S$ and $A$. Prove that $ST$, $AL$, and $BC$ are concurrent. $\text{Vangelis Psychas and Silouanos Brazitikos}$

How many ways are there for Nick to travel from $(0,0)$ to $(16,16)$ in the coordinate plane by moving one unit in the positive $x$ or $y$ direction at a time, such that Nick changes direction an odd number of times?

Given a non-isosceles triangle $ABC$, let $D,E$, and $F$ denote the midpoints of the sides $BC,CA$, and $AB$ respectively. The circle $BCF$ and the line $BE$ meet again at $P$, and the circle $ABE$ and the line $AD$ meet again at $Q$. Finally, the lines $DP$ and $FQ$ meet at $R$. Prove that the centroid $G$ of the triangle $ABC$ lies on the circle $PQR$. [i](United Kingdom) David Monk[/i]

At a movie theater tickets for adults cost $4$ dollars more than tickets for children. One afternoon the theater sold $100$ more child tickets than adult tickets for a total sales amount of $1475$ dollars. How many dollars would the theater have taken in if the same tickets were sold, but the costs of the child tickets and adult tickets were reversed?

Let $f(n) = n + \lfloor \sqrt{n} \rfloor$. Prove that for every positive integer $m$, the integer sequence $m, f(m), f(f(m)), \dots$ contains at least one square of an integer.