There are $n>2$ lines on the plane in general position; Meaning any two of them meet, but no three are concurrent. All their intersection points are marked, and then all the lines are removed, but the marked points are remained. It is not known which marked point belongs to which two lines. Is it possible to know which line belongs where, and restore them all? [i]Proposed by Boris Frenkin - Russia[/i]

In triangle $ABC$, $AB = 1$ and $AC = 2$. Suppose there exists a point $P$ in the interior of triangle $ABC$ such that $\angle PBC = 70^{\circ}$, and that there are points $E$ and $D$ on segments $AB$ and $AC$, such that $\angle BPE = \angle EPA = 75^{\circ}$ and $\angle APD = \angle DPC = 60^{\circ}$. Let $BD$ meet $CE$ at $Q,$ and let $AQ$ meet $BC$ at $F.$ If $M$ is the midpoint of $BC$, compute the degree measure of $\angle MPF.$ [i]Authors: Alex Zhu and Ray Li[/i]

Alice and Bob play a game with a string of $2015$ pearls. In each move, one player cuts the string between two pearls and the other player chooses one of the resulting parts of the string while the other part is discarded. In the first move, Alice cuts the string, thereafter, the players take turns. A player loses if he or she obtains a string with a single pearl such that no more cut is possible. Who of the two players does have a winning strategy? (Theresia Eisenkölbl)

Let $P$ be a point inside a square $ABCD$ such that $PA:PB:PC$ is $1:2:3$. Determine the angle $\angle BPA$.

Let $ABC$ be an acute triangle with incenter $I$, circumcenter $O$, and circumcircle $\Gamma$. Let $M$ be the midpoint of $\overline{AB}$. Ray $AI$ meets $\overline{BC}$ at $D$. Denote by $\omega$ and $\gamma$ the circumcircles of $\triangle BIC$ and $\triangle BAD$, respectively. Line $MO$ meets $\omega$ at $X$ and $Y$, while line $CO$ meets $\omega$ at $C$ and $Q$. Assume that $Q$ lies inside $\triangle ABC$ and $\angle AQM = \angle ACB$. Consider the tangents to $\omega$ at $X$ and $Y$ and the tangents to $\gamma$ at $A$ and $D$. Given that $\angle BAC \neq 60^{\circ}$, prove that these four lines are concurrent on $\Gamma$. [i]Evan Chen and Yannick Yao[/i]

Let \(a\), \(b\), and \(n\) be positive integers. A lemonade stand owns \(n\) cups, all of which are initially empty. The lemonade stand has a [i]filling machine[/i] and an [i]emptying machine[/i], which operate according to the following rules: [list] [*]If at any moment, \(a\) completely empty cups are available, the filling machine spends the next \(a\) minutes filling those \(a\) cups simultaneously and doing nothing else. [*]If at any moment, \(b\) completely full cups are available, the emptying machine spends the next \(b\) minutes emptying those \(b\) cups simultaneously and doing nothing else. [/list] Suppose that after a sufficiently long time has passed, both the filling machine and emptying machine work without pausing. Find, in terms of \(a\) and \(b\), the least possible value of \(n\). [i]Proposed by Raymond Feng[/i]

For what digit $d$ is the base $9$ numeral $7d35_9$ divisible by $8?$ [i]Proposed by Alex Li[/i]

Below is a $4\times4$ grid. We wish to fill in the grid such that each row, each column, and each $2\times2$ square outlined by the double lines contains the digits 1 through 4. The first row has already been filled in. Find, with proof, the number of ways we can complete the rest of the grid. \[ \begin{tabular}{||c|c||c|c||}\hline\hline 1 & 2 & 3 & 4\\ \hline &&&\\ \hline\hline &&&\\ \hline &&&\\ \hline\hline \end{tabular} \]

[i](8 pts)[/i] Let $n$ be a positive integer, and let $a, b, c$ be real numbers. (a) [i](2 pts)[/i] Given that $a\cos x+b\cos 2x +c\cos 3x \geq -1$ for all reals $x$, find, with proof, the maximum possible value of $a+b+c$. (b) [i](6 pts)[/i] Let $f$ be a degree $n$ polynomial with real coefficients. Suppose that $|f(z)| \leq \left|f(z)+\frac{2}{z}\right|$ for all complex $z$ lying on the unit circle. Find, with proof, the maximum possible value of $f(1)$.

For any positive integer $k$ denote by $S(k)$ the number of solutions $(x,y)\in \mathbb{Z}_+ \times \mathbb{Z}_+$ of the system $$\begin{cases} \left\lceil\frac{x\cdot d}{y}\right\rceil\cdot \frac{x}{d}=\left\lceil\left(\sqrt{y}+1\right)^2\right\rceil \\ \mid x-y\mid =k , \end{cases}$$ where $d$ is the greatest common divisor of positive integers $x$ and $y.$ Determine $S(k)$ as a function of $k$. (Here $\lceil z\rceil$ denotes the smalles integer number which is bigger or equal than $z.$)

Let $a$ and $b$ be two circles, intersecting in two distinct points $Y$ and $Z$. A circle $k$ touches the circles $a$ and $b$ externally in the points $A$ and $B$. Show that the angular bisectors of the angles $\angle ZAY$ and $\angle YBZ$ intersect on the line $YZ$.

Let $ \mathcal{H}_n$ be the set of all numbers of the form $ 2 \pm\sqrt{2 \pm\sqrt{2 \pm\ldots\pm\sqrt 2}}$ where "root signs" appear $ n$ times. (a) Prove that all the elements of $ \mathcal{H}_n$ are real. (b) Computer the product of the elements of $ \mathcal{H}_n$. (c) The elements of $ \mathcal{H}_{11}$ are arranged in a row, and are sorted by size in an ascending order. Find the position in that row, of the elements of $ \mathcal{H}_{11}$ that corresponds to the following combination of $ \pm$ signs: \[ \plus{}\plus{}\plus{}\plus{}\plus{}\minus{}\plus{}\plus{}\minus{}\plus{}\minus{}\]

Let $\mathbb R$ be the set of real numbers. We denote by $\mathcal F$ the set of all functions $f\colon\mathbb R\to\mathbb R$ such that $$f(x + f(y)) = f(x) + f(y)$$ for every $x,y\in\mathbb R$ Find all rational numbers $q$ such that for every function $f\in\mathcal F$, there exists some $z\in\mathbb R$ satisfying $f(z)=qz$.

The lateral surface of a cylinder of revolution is divided by $n-1$ planes parallel to the base and $m$ parallel generators into $mn$ cases $( n\ge 1,m\ge 3)$. Two cases will be called neighbouring cases if they have a common side. Prove that it is possible to write a real number in each case such that each number is equal to the sum of the numbers of the neighbouring cases and not all the numbers are zero if and only if there exist integers $k,l$ such that $n+1$ does not divide $k$ and \[ \cos \frac{2l\pi}{m}+\cos\frac{k\pi}{n+1}=\frac{1}{2}\] [i]Ciprian Manolescu[/i]

Let $ a_1, a_2, \ldots, a_{100}$ be nonnegative real numbers such that $ a^2_1 \plus{} a^2_2 \plus{} \ldots \plus{} a^2_{100} \equal{} 1.$ Prove that \[ a^2_1 \cdot a_2 \plus{} a^2_2 \cdot a_3 \plus{} \ldots \plus{} a^2_{100} \cdot a_1 < \frac {12}{25}. \] [i]Author: Marcin Kuzma, Poland[/i]

Let $l, l'$ be two lines in $3$-space and let $A,B,C$ be three points taken on $l$ with $B$ as midpoint of the segment $AC$. If $a, b, c$ are the distances of $A,B,C$ from $l'$, respectively, show that $b \leq \sqrt{ \frac{a^2+c^2}{2}}$, equality holding if $l, l'$ are parallel.

$\Delta ABC$ is isosceles with a circumscribed circle $\omega (O)$. Let $H$ be the foot of the altitude from $C$ to $AB$ and let $M$ be the middle point of $AB$. We define a point $X$ as the second intersection point of the circle with diameter $CM$ and $\omega$ and let $XH$ intersect $\omega$ for a second time in $Y$. If $CO\cap AB=D$, then prove that the circumscribed circle of $\Delta YHD$ is tangent to $\omega$.

In the [i]minesweeper[/i] game below, each unopened square (for example, the one in the top left corner) is either empty or contains a mine. The other squares are empty and display the number of mines in the neighboring 8 squares (if this is 0, the square is unmarked). What is the minimum possible number of mines present on the field? [img]http://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZS9hLzNlYTNhMjI2YWYyNmFkZGFiNWFmODBhNzA3YjA3OWM5MTZlNDlkLnBuZw==&rn=bWluZXN3ZWVwZXIucG5n[/img] [i]2016 CCA Math Bonanza Team #4[/i]

Let $ABC$ be a triangle with $AB = 80, BC = 100, AC = 60$. Let $D, E, F$ lie on $BC, AC, AB$ such that $CD = 10, AE = 45, BF = 60$. Let $P$ be a point in the plane of triangle $ABC$. The minimum possible value of $AP+BP+CP+DP+EP+FP$ can be expressed in the form $\sqrt{x}+\sqrt{y}+\sqrt{z}$ for integers $x, y, z$. Find $x+y+z$. [i]Proposed by Yang Liu[/i]

* Cut out of a $3 \times 3$ square an unfolding of the cube with edge $1$.

Suppose four coplanar points $A, B, C$, and $D$ satisfy $AB = 3$, $BC = 4$, $CA = 5$, and $BD = 6$. Determine the maximal possible area of $\vartriangle ACD$.

In a country, there are ${}N{}$ cities and $N(N-1)$ one-way roads: one road from $X{}$ to $Y{}$ for each ordered pair of cities $X \neq Y$. Every road has a maintenance cost. For each $k = 1,\ldots, N$ let's consider all the ways to select $k{}$ cities and $N - k{}$ roads so that from each city it is possible to get to some selected city, using only selected roads. We call such a system of cities and roads with the lowest total maintenance cost $k{}$[i]-optimal[/i]. Prove that cities can be numbered from $1{}$ to $N{}$ so that for each $k = 1,\ldots, N$ there is a $k{}$-optimal system of roads with the selected cities numbered $1,\ldots, k$. [i]Proposed by V. Buslov[/i]

A triple of numbers $(a_1,a_2,a_3)=(3,4,12)$ is given. The following operation is performed a finite number of times: choose two numbers $a,b$ from the triple and replace them by $0.6x-0.8y$ and $0.8x+0.6y$. Is it possible to obtain the (unordered) triple $(2,8,10)$?

For each positive integer $ n$, let $ c(n)$ be the largest real number such that \[ c(n) \le \left| \frac {f(a) \minus{} f(b)}{a \minus{} b}\right|\] for all triples $ (f, a, b)$ such that --$ f$ is a polynomial of degree $ n$ taking integers to integers, and --$ a, b$ are integers with $ f(a) \neq f(b)$. Find $ c(n)$. [i]Shaunak Kishore.[/i]

A positive integer $n$ has the property that, for any $2$ integers $a$ and $b$, if $ab + 1$ is divisible by $n$, then $a + b$ is also divisible by $n$. What is the largest possible value of $n$?