The siblings Robb, Arya and Sansa have received seven sealed bags from an unknown donor with varying number of beads. Six of the bags have labels indicating the number beads: $7, 9, 11, 13, 15, 18$, but the seventh bag lacks etiquette. The sensor has set certain requirements: Robb must have three bags and his sisters two bags each. In addition, Arya will have the bag that contains $7$ beads. The bags should be distributed so that each of the siblings get the same number of pearls (this is possible according to the donor). How many pearls are there in the bag without a label, how many pearls are there in total and how should the bags be distributed?

In a cyclic quadrilateral $ABCD$ we have $|AD| > |BC|$ and the vertices $C$ and $D$ lie on the shorter arc $AB$ of the circumcircle. Rays $AD$ and $BC$ intersect at point $K$, diagonals $AC$ and $BD$ intersect at point $P$. Line $KP$ intersects the side $AB$ at point $L$. Prove that $\angle ALK$ is acute.

Julius has a set of five positive integers whose mean is 100. If Julius removes the median of the set of five numbers, the mean of the set increases by 5, and the median of the set decreases by 5. Find the maximum possible value of the largest of the five numbers Julius has.

In a triangle $ ABC$, the bisectors of the angles at $ B$ and $ C$ meet the opposite sides $ B_1$ and $ C_1$, respectively. Let $ T$ be the midpoint $ AB_1$. Lines $ BT$ and $ B_1C_1$ meet at $ E$ and lines $ AB$ and $ CE$ meet at $ L$. Prove that the lines $ TL$ and $ B_1C_1$ have a point in common.

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that \[f(x+y) + f(x)f(y) = f(xy) + (y+1)f(x) + (x+1)f(y)\] for all $x,y \in \mathbb{R}$.

Let $f: Z^+ \to Z^+ \cup \{0\}$ a function that meets the following conditions: a) $f (a b) = f (a) + f (b)$, b) $f (a) = 0$ provided that the digits of the unit of $a$ are $7$, c) $f (10) = 0$. Find $f (2016).$

Let $f : \mathbb{Z} \to \mathbb{Z}$ be a function satisfying $f(0) \neq 0 = f(1)$. Assume also that $f$ satisfies equations [b](A)[/b] and [b](B)[/b] below. \begin{eqnarray*}f(xy) = f(x) + f(y) -f(x) f(y)\qquad\mathbf{(A)}\\ f(x-y) f(x) f(y) = f(0) f(x) f(y)\qquad\mathbf{(B)} \end{eqnarray*} for all integers $x,y$. [b](i)[/b] Determine explicitly the set $\big\{f(a)~:~a\in\mathbb{Z}\big\}$. [b](ii)[/b] Assuming that there is a non-zero integer $a$ such that $f(a) \neq 0$, prove that the set $\big\{b~:~f(b) \neq 0\big\}$ is infinite.

Let $m$ and $n$ be positive integers. In Philand, the Kingdom of Olymphics, with $m$ cities, and the Kingdom of Mathematicians for Fun, with $n$ cities, fight a battle in rounds. Some cities in the country are connected by roads, so that it is possible to travel through all the cities via the roads. In each round of the battle, if all cities neighboring, that is, connected directly by a road, a city in one of the kingdoms are from the other kingdom, that city is conquered in the next round and switches to the other kingdom. Knowing that between the first and second round, at least one city is not conquered, show that at some point the battle must end, i.e., no city can be captured by another kingdom.

How many $8$-digit numbers are $*2*0*1*7$, where four unknown numbers are replaced by stars, which are divisible by $7$?

Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

$T$ is a given triangle with vertices $P_1,P_2,P_3$. Consider an arbitrary subdivision of $T$ into finitely many subtriangles such that no vertex of a subtriangle lies strictly between two vertices of another subtriangle. To each vertex $V$ of the subtriangles there is assigned a number $n(V)$ according to the following rules: $(\text{i})$ If $V$ = $P_i$, then $n(V) = i$. $(\text{ii})$ If $V$ lies on the side $P_i P_j$ of $T$, then $n(V) = i$ or $j$. $(\text{iii})$ If $V$ lies inside the triangle $T$, then $n(V)$ is any of the numbers $1,2,3$. Prove that there exists at least one subtriangle whose vertices are numbered $1, 2, 3$.

A point $P$ in the interior of a convex polyhedron in Euclidean space is called a [i]pivot point[/i] of the polyhedron if every line through $P$ contains exactly $0$ or $2$ vertices of the polyhedron. Determine, with proof, the maximum number of pivot points that a polyhedron can contain.

Let $a_0, a_1, \ldots, a_9$ and $b_1 , b_2, \ldots,b_9$ be positive integers such that $a_9<b_9$ and $a_k \neq b_k, 1 \leq k \leq 8.$ In a cash dispenser/automated teller machine/ATM there are $n\geq a_9$ levs (Bulgarian national currency) and for each $1 \leq i \leq 9$ we can take $a_i$ levs from the ATM (if in the bank there are at least $a_i$ levs). Immediately after that action the bank puts $b_i$ levs in the ATM or we take $a_0$ levs. If we take $a_0$ levs from the ATM the bank doesn’t put any money in the ATM. Find all possible positive integer values of $n$ such that after finite number of takings money from the ATM there will be no money in it.

Let $a,b,c,d$ be four non-negative numbers satisfying \[ a+b+c+d=1. \] Prove the inequality \[ a \cdot b \cdot c + b \cdot c \cdot d + c \cdot d \cdot a + d \cdot a \cdot b \leq \frac{1}{27} + \frac{176}{27} \cdot a \cdot b \cdot c \cdot d. \]

In a plane we are given two distinct points $A,B$ and two lines $a, b$ passing through $B$ and $A$ respectively $(a \ni B, b \ni A)$ such that the line $AB$ is equally inclined to a and b. Find the locus of points $M$ in the plane such that the product of distances from $M$ to $A$ and a equals the product of distances from $M$ to $B$ and $b$ (i.e., $MA \cdot MA' = MB \cdot MB'$, where $A'$ and $B'$ are the feet of the perpendiculars from $M$ to $a$ and $b$ respectively).

A triangle in the coordinate plane has vertices $A(\log_21,\log_22)$, $B(\log_23,\log_24)$, and $C(\log_27,\log_28)$. What is the area of $\triangle ABC$? $ \textbf{(A) }\log_2\frac{\sqrt3}7\qquad \textbf{(B) }\log_2\frac3{\sqrt7}\qquad \textbf{(C) }\log_2\frac7{\sqrt3}\qquad \textbf{(D) }\log_2\frac{11}{\sqrt7}\qquad \textbf{(E) }\log_2\frac{11}{\sqrt3}\qquad $