Given a triangle $ABC$, $A_1$ divides the length of the path $CAB$ into two equal parts, and define $B_1$ and $C_1$ analogously. Let $l_A$, $l_B$, $l_C$ be the lines passing through $A_1$, $B_1$ and $C_1$ and being parallel to the bisectors of $\angle A$, $\angle B$, and $\angle C$. Show that $l_A$, $l_B$, $l_C$ are concurrent.

Let $ABC$ be an equilateral triangle and $n\ge 2$ be an integer. Denote by $\mathcal{A}$ the set of $n-1$ straight lines which are parallel to $BC$ and divide the surface $[ABC]$ into $n$ polygons having the same area and denote by $\mathcal{P}$ the set of $n-1$ straight lines parallel to $BC$ which divide the surface $[ABC]$ into $n$ polygons having the same perimeter. Prove that the intersection $\mathcal{A} \cap \mathcal{P}$ is empty. [i]Laurentiu Panaitopol[/i]

If $0<a_1< \cdots < a_n$, show that the following equation has exactly $n$ roots. $$ \frac{a_1}{a_1-x}+\frac{a_2}{a_2-x}+ \frac{a_3}{a_3-x}+ \cdots + \frac {a_n}{a_n - x} = 2015$$

Let $\lambda$ be a positive real number. Inequality $|\lambda xy+yz|\le \dfrac{\sqrt5}{2}$ holds for arbitrary real numbers $x, y, z$ satisfying $x^2+y^2+z^2=1$. Find the maximal value of $\lambda$.

Let ${c\equiv c\left(O, R\right)}$ be a circle with center ${O}$ and radius ${R}$ and ${A, B}$ be two points on it, not belonging to the same diameter. The bisector of angle${\angle{ABO}}$ intersects the circle ${c}$ at point ${C}$, the circumcircle of the triangle $AOB$ , say ${c_1}$ at point ${K}$ and the circumcircle of the triangle $AOC$ , say ${{c}_{2}}$ at point ${L}$. Prove that point ${K}$ is the circumcircle of the triangle $AOC$ and that point ${L}$ is the incenter of the triangle $AOB$. Evangelos Psychas (Greece)

A train accelerates at $10$ mph/min, and decelerates at $20$ mph/min. The train’s maximum speed is $300$ mph. What’s the shortest amount of the time that the train could take to travel $500$ miles, if it has to be stationary at both the start and end of its trip? Please give your answer in minutes.

Let $t_{k} = a_{1}^k + a_{2}^k +...+a_{n}^k$, where $a_{1}$, $a_{2}$, ... $a_{n}$ are positive real numbers and $k \in \mathbb{N}$. Prove that $$\frac{t_{5}^2 t_1^{6}}{15} - \frac{t_{4}^4 t_{2}^2 t_{1}^2}{6} + \frac{t_{2}^3 t_{4}^5}{10} \geq 0 $$ [i]Proposed by Daniel Velinov[/i]

Say a positive integer $n>1$ is $d$-coverable if for each non-empty subset $S\subseteq \{0, 1, \ldots, n-1\}$, there exists a polynomial $P$ with integer coefficients and degree at most $d$ such that $S$ is exactly the set of residues modulo $n$ that $P$ attains as it ranges over the integers. For each $n$, find the smallest $d$ such that $n$ is $d$-coverable, or prove no such $d$ exists. [i]Proposed by Carl Schildkraut[/i]

Let $\{x\}$ denote the fractional part of $x$, which means the unique real $0\leq\{x\}<1$ such that $x-\{x\}$ is an integer. Let $f_{a,b}(x)=\{x+a\}+2\{x+b\}$ and let its range be $[m_{a,b},M_{a,b})$. Find the minimum value of $M_{a,b}$ as $a$ and $b$ range along all real numbers.

The extension of the median $AM$ of the triangle $ABC$ intersects its circumcircle at $D$. The circumcircle of triangle $CMD$ intersects the line $AC$ at $C$ and $E$.The circumcircle of triangle $AME$ intersects the line $AB$ at $A$ and $F$. Prove that $CF$ is the altitude of triangle $ABC$.

A regular triangular prism has the altitude $h,$ and the two bases of the prism are equilateral triangles with side length $a.$ Dream-holes are made in the centers of both bases, and the three lateral faces are mirrors. Assume that a ray of light, entering the prism through the dream-hole in the upper base, then being reflected once by any of the three mirrors, quits the prism through the dream-hole in the lower base. Find the angle between the upper base and the light ray at the moment when the light ray entered the prism, and the length of the way of the light ray in the interior of the prism.

Given an $1$ x $n$ table ($n\geq 2$), two players alternate the moves in which they write the signs + and - in the cells of the table. The first player always writes +, while the second always writes -. It is not allowed for two equal signs to appear in the adjacent cells. The player who can’t make a move loses the game. Which of the players has a winning strategy?

Let $n \ge 3$ be an integer and $S$ be a set of $n$ elements. Determine the largest integer $k_n$ such that: for each selection of $k_n$ $3-$subsets of $S$, there exists a way to color elements of $S$ with two colors such that none of the chosen $3-$subset is monochromatic.

Suppose that $p|(2t^2-1)$ and $p^2|(2st+1)$. Prove that $p^2|(s^2+t^2-1)$

Let $p$ be a prime where $p \ge 5$. Prove that $\exists n$ such that $1+ (\sum_{i=2}^n \frac{1}{i^2})(\prod_{i=2}^n i^2) \equiv 0 \pmod p$

Consider a triangle $ABC$ with $AB < AC$ and let $H$ and $O$ be its orthocenter and circumcenter, respectively. A line starting from $B$ cuts the lines $AO$ and $AH$ at $M$ and $M'$ so that $M'$ is the midpoint of $BM$. Another line starting from $C$ cuts the lines $AH$ and $AO$ at $N$ and $N'$ so that $N'$ is the midpoint of $CN$. Prove that $M, M', N, N'$ are on the same circle.

The enemy ship has landed on a $9\times 9$ board that covers exactly $5$ squares of the board, like this: [img]https://cdn.artofproblemsolving.com/attachments/2/4/ae5aa95f5bb5e113fd5e25931a2bf8eb872dbe.png[/img] The ship is invisible. Each defensive missile covers exactly one square, and destroys the ship if it hits one of the $5$ squares that it occupies. Determine the minimum number of missiles needed to destroy the enemy ship with certainty .

The diameter of a circle is divided into $ n$ equal parts. On each part a semicircle is construced. As $ n$ becomes very large, the sum of the lengths of the arcs of the semicircles approaches a length: $ \textbf{(A)}$ equal to the semi-circumference of the original circle $ \textbf{(B)}$ equal to the diameter of the original circle $ \textbf{(C)}$ greater than the diameter but less than the semi-circumeference of the original circle $ \textbf{(D)}$ that is infinite $ \textbf{(E)}$ greater than the semi-circumference but finite

We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions: $\bullet$ gcd $(a, b, c)=1$, $\bullet$ gcd $(a, b + c)>1$, $\bullet$ gcd $(b, c + a)>1$, $\bullet$ gcd $(c, a + b)>1$. a) Is it possible that $a + b + c = 2015$? b) Determine the minimum possible value that the sum $a+ b+ c$ can take.

What is the sum (in base $10$) of all the natural numbers less than $64$ which have exactly three ones in their base $2$ representation?

Let $ x, y, z, w $ be nonzero real numbers such that $ x+y \ne 0$, $ z+w \ne 0 $, and $ xy+zw \ge 0 $. Prove that \[ \left( \frac{x+y}{z+w} + \frac{z+w}{x+y} \right) ^{-1} + \frac{1}{2} \ge \left( \frac{x}{z} + \frac{z}{x} \right) ^{-1} + \left( \frac{y}{w} + \frac{w}{y} \right) ^{-1}\]

Let $n$ be a natural number, $n \ge 5$, and $a_1, a_2, . . . , a_n$ real numbers such that all possible sums $a_i + a_j$, where $1 \le i < j \le n$, form $\frac{n(n-1)}{2}$ consecutive members of an arithmetic progression when taken in some order. Prove that $a_1 = a_2 = . . . = a_n$.

The plane has a semicircle with center $O$ and diameter $AB$. Chord $CD$ is parallel to the diameter $AB$ and $\angle AOC = \angle DOB = \frac{7}{16}$ (radians). Which of the two parts it divides into a semicircle is larger area?

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]

Let $p$ be a prime number. Troy and Abed are playing a game. Troy writes a positive integer $X$ on the board, and gives a sequence $(a_n)_{n\in\mathbb{N}}$ of positive integers to Abed. Abed now makes a sequence of moves. The $n$-th move is the following: $$\text{ Replace } Y \text{ currently written on the board with either } Y + a_n \text{ or } Y \cdot a_n.$$ Abed wins if at some point the number on the board is a multiple of $p$. Determine whether Abed can win, regardless of Troy’s choices, if $a) p = 10^9 + 7$; $b) p = 10^9 + 9$. [i]Remark[/i]: Both $10^9 + 7$ and $10^9 + 9$ are prime. [i]Proposed by Ivan Novak[/i]