The grid shown below is completed by choosing nine of the following numbers without repeating: $4, 5, 6, 7, 8, 12, 13, 16, 18, 19$. If the sum of the five rows are equal to each other and the sum of the three columns are equal to each other, in how many different ways is it possible to fill the grid? $ \begin {array} {| c | c | c |} \hline 10 & & \\ \hline & & 9 \\ \hline & 3 & \\ \hline 11 & & 17 \\ \hline & 20 & \\ \hline \end {array} $ Note: The sum of the rows and the sum of the columns are not necessarily equal.

There are seven piles with $2014$ pebbles each and a pile with $2008$ pebbles. Ana and Beto play in turns and Ana always plays first. One move consists of removing pebbles from all the piles. From each pile is removed a different amount of pebbles, between $1$ and $8$ pebbles. The first player who cannot make a move loses. a) Who has a winning strategy? b) If there were seven piles with $2015$ pebbles each and a pile with $2008$ pebbles, who has a winning strategy?

Let $ABC$ be a triangle with orthocenter $H$ and $\ell$ a line that passes through $H$, and is parallel to $BC$. Let $m$ and $n$ be the reflections of $\ell$ on the sides of $AB$ and $AC$, respectively, $m$ and $n$ are intersect at $P$. If $HP$ and $BC$ intersect at $Q$, prove that the parallel to $AH$ through $Q$ and $AP$ intersect at the circumcenter of the triangle $ABC$.

Let $A$ be one of the two points where the circles whose centers are the points $M$ and $N$ intersect. The tangents in $A$ to such circles intersect them again in $B$ and $C$, respectively. Let $P$ be a point such that the quadrilateral $AMPN$ is a parallelogram. Show that $P$ is the circumcenter of triangle $ABC$.

An arithmetic sequence is a sequence of $(a_1, a_2, \dots, a_n) $ such that the difference between any two consecutive terms is the same. That is, $a_ {i + 1} -a_i = d $ for all $i \in \{1,2, \dots, n-1 \} $, where $d$ is the difference of the progression. A sequence $(a_1, a_2, \dots, a_n) $ is tlaxcalteca if for all $i \in \{1,2, \dots, n-1 \} $, there exists $m_i $ positive integer such that $a_i = \frac {1} {m_i}$. A taxcalteca arithmetic progression $(a_1, a_2, \dots, a_n )$ is said to be maximal if $(a_1-d, a_1, a_2, \dots, a_n) $ and $(a_1, a_2, \dots, a_n, a_n + d) $ are not Tlaxcalan arithmetic progressions. Is there a maximal tlaxcalteca arithmetic progression of $11$ elements?

In Tlaxcala, there is a transportation system that works through buses that travel from one city to another in one direction . A set $S$ of cities is said beautiful if it contains at least three different cities and from each city $A$ in $S$ at least two buses depart, each one goes directly to a different city in $S$ and none of them is $A$ (if there is a direct bus from $A$ to a city $B$ in $S$, there is not necessarily a direct bus from $B$ to $A$). Show that if there exists a beautiful set of cities $S$, then there exists a beautiful $T$ subset of $S$, such that for any two cities in $T$, you can get from one to another by taking buses that only pass through cities in $T$. Note: A bus goes directly from one city to another if it does not pass through any other city.