$A$ writes, at his choice, $8$ ones and $8$ twos on a $4\times 4$ board. Then $B$ covers the board with $8$ dominoes and for each domino she finds the smaller of the two numbers that that domino covers. Finally, $A$ adds these $8$ numbers and the result is her score. What is the highest score $A$ can secure, no matter how $B$ plays? Clarification: A domino is a $1\times 2$ or $2\times 1$ rectangle that covers exactly two squares on the board.

Let $a, b, c$ and $d$ be elements of the set $\{ 1, 2, 3,\ldots , 2014, 2015 \}$ such that $a < b < c < d$, $a + b$ is a divisor of $c + d$, and $a + c$ is a divisor of $b + d$. Determine the largest value that $a$ can take.

Let $ABCD$ be a parallelogram, let $X$ and $Y$ in the segments $AB$ and $CD$, respectively. The segments $AY$ and $DX$ intersects in $P$ and the segments $BY$ and $DX$ intersects in $Q$, show that the line $PQ$ passes in a fixed point(independent of the positions of the points $X$ and $Y$). I guess that the fixed point is the midpoint of $BD$.

In a small city there are $n$ bus routes, with $n > 1$, and each route has exactly $4$ stops. If any two routes have exactly one common stop, and each pair of stops belongs to exactly one route, find all possible values of $n$.

Find the smallest term of the sequence $a_1, a_2, a_3, \ldots$ defined by $a_1=2014^{2015^{2016}}$ and $$ a_{n+1}= \begin{cases} \frac{a_n}{2} & \text{ if } a_n \text{ is even} \\ a_n + 7 & \text{ if } a_n \text{ is odd} \\ \end{cases} $$

Let $n$ be a positive integer. On a $2n\times 2n$ board, the $2n^2$ squares were painted white and the other $2n^2$ squares were painted black. One operation is to choose a $2\times 2$ subtable and mirror its $4$ cells about the vertical or horizontal axis of symmetry of that subtable. For what values of $n$ is it always possible to obtain a chess-like coloring from any initial coloring?

In the plan $6$ points were located such that the distance between two damages of them is greater than or equal to $1$. Prove that it is possible to choose two of those points such that their distance is greater than or equal to $2 \cos{18}$ Observation: It might help you to know that $\cos{18} = 0.95105\ldots$ and $\cos{24} = 0.91354\ldots$

Let $ABCD$ be a cyclic quadrilateral such that the lines $AB$ and $CD$ intersects in $K$, let $M$ and $N$ be the midpoints of $AC$ and $CK$ respectively. Find the possible value(s) of $\angle ADC$ if the quadrilateral $MBND$ is cyclic.

Let $m$ and $n$ be positive integers. A child walks the Cartesian plane taking a few steps. The child begins its journey at the point $(0, n)$ and ends at the point $(m, 0)$ in such a way that: $\bullet$ Each step has length $1$ and is parallel to either the $X$ or $Y$ axis. $\bullet$ For each point $(x, y)$ of its path it is true that $x\ge 0$ and $y\ge 0$. For each step of the child, the distance between the child and the axis to which said step is parallel is calculated. If the step causes the child to be further from the point $(0, 0)$ than before, we consider that distance as positive, otherwise, we consider that distance as negative. Prove that at the end of the boy's journey, the sum of all the distances is $0$.

Let $n$ be a positive integer. There is a collection of cards that meets the following properties: $\bullet$Each card has a number written in the form $m!$, where $m$ is a positive integer. $\bullet$For every positive integer $t\le n!$, it is possible to choose one or more cards from the collection in such a way $\text{ }$that the sum of the numbers of those cards is $t$. Determine, based on $n$, the smallest number of cards that this collection can have.