Let $ABCD$ be a trapezoid with bases $AD$ and $BC$, and let $M$ be the midpoint of $CD$. The circumcircle of triangle $BCM$ meets $AC$ and $BD$ again at $E$ and $F$, with $E$ and $F$ distinct, and line $EF$ meets the circumcircle of triangle $AEM$ again at $P$. Prove that $CP$ is parallel to $BD$. Proposed by Ariel García

An equilateral triangle of side $n$ has been divided into little equilateral triangles of side $1$ in the usual way. We draw a path over the segments of this triangulation, in such a way that it visits exactly once each one of the $\frac{(n+1)(n+2)}{2}$ vertices. What is the minimum number of times the path can change its direction? The figure below shows a valid path on a triangular board of side $4$, with exactly $9$ changes of direction. [asy][asy] unitsize(30); pair h = (1, 0); pair v = dir(60); pair d = dir(120); for(int i = 0; i < 4; ++i) { draw(i*v -- i*v + (4 - i)*h); draw(i*h -- i*h + (4 - i)*v); draw((i + 1)*h -- (i + 1)*h + (i + 1)*d); } draw(h + v -- v -- (0, 0) -- 2*h -- 2*h + v -- h + 2*v -- 2*v -- 4*v -- 3*h + v -- 3*h -- 4*h, linewidth(2)); draw(3*h -- 4*h, EndArrow); fill(circle(h + v, 0.1)); [/asy][/asy] Proposed by Oriol Solé

Find all $n$-tuples of real numbers $(x_1, x_2, \dots, x_n)$ such that, for every index $k$ with $1\leq k\leq n$, the following holds: \[ x_k^2=\sum\limits_{\substack{i < j \\ i, j\neq k}} x_ix_j \] Proposed by Oriol Solé

For each positive integer $n$ let $s(n)$ denote the sum of the decimal digits of $n$. Find all pairs of positive integers $(a, b)$ with $a > b$ which simultaneously satisfy the following two conditions $$a \mid b + s(a)$$$$b \mid a + s(b)$$ Proposed by Victor Domínguez

Let $ABC$ be a triangle with circumcirle $\Gamma$, and let $M$ and $N$ be the respective midpoints of the minor arcs $AB$ and $AC$ of $\Gamma$. Let $P$ and $Q$ be points such that $AB=BP$, $AC=CQ$, and $P$, $B$, $C$, $Q$ lie on $BC$ in that order. Prove that $PM$ and $QN$ meet at a point on $\Gamma$. Proposed by Victor Domínguez

Let $A$ be a finite set of positive integers, and for each positive integer $n$ we define \[S_n = \{x_1 + x_2 + \cdots + x_n \;\vert\; x_i \in A \text{ for } i = 1, 2, \dots, n\}\] That is, $S_n$ is the set of all positive integers which can be expressed as sum of exactly $n$ elements of $A$, not necessarily different. Prove that there exist positive integers $N$ and $k$ such that $$\left\vert S_{n + 1} \right\vert = \left\vert S_n \right\vert + k \text{ for all } n\geq N.$$ Proposed by Ariel García