A set $P$ has the following property: “For any positive integer $k$, if $p$ is a prime factor of $k^3+6$, then $p$ belongs to $P$ ”. Prove that $P$ is infinite.

A magician and his assistant perform in front of an audience of many people. On the stage there is an $8$×$8$ board, the magician blindfolds himself, and then the assistant goes inviting people from the public to write down the numbers $1, 2, 3, 4, . . . , 64$ in the boxes they want (one number per box) until completing the $64$ numbers. After the assistant covers two adyacent boxes, at her choice. Finally, the magician removes his blindfold and has to $“guess”$ what number is in each square that the assistant. Explain how they put together this trick. $Clarification:$ Two squares are adjacent if they have a common side

Let $M, N, P$ be the midpoints of the sides $AB, BC, CA$ of a triangle $ABC$. Let $X$ be a fixed point inside the triangle $MNP$. The lines $L_1, L_2, L_3$ that pass through point $X$ are such that $L_1$ intersects segment $AB$ at point $C_1$ and segment $AC$ at point $B_2$; $L_2$ intersects segment $BC$ at point $A_1$ and segment $BA$ at point $C_2$; $L_3$ intersects segment $CA$ at point $B_1$ and segment $CB$ at point $A_2$. Indicates how to construct the lines $L_1, L_2, L_3$ in such a way that the sum of the areas of the triangles $A_1A_2X, B_1B_2X$ and $C_1C_2X$ is a minimum.

Let $ABC$ be a triangle such that $AB < BC$. Plot the height $BH$ with $H$ in $AC$. Let I be the incenter of triangle $ABC$ and $M$ the midpoint of $AC$. If line $MI$ intersects $BH$ at point $N$, prove that $BN < IM$.

Let $a, b, c$ be positive integers whose greatest common divisor is $1$. Determine whether there always exists a positive integer $n$ such that, for every positive integer $k$, the number $2^n$ is not a divisor of $a^k+b^k+c^k$.

Let $P$ be a set of $n \ge 2$ distinct points in the plane, which does not contain any triplet of aligned points. Let $S$ be the set of all segments whose endpoints are points of $P$. Given two segments $s_1, s_2 \in S$, we write $s_1 \otimes s_2$ if the intersection of $s_1$ with $s_2$ is a point other than the endpoints of $s_1$ and $s_2$. Prove that there exists a segment $s_0 \in S$ such that the set $\{s \in S | s_0 \otimes s\}$ has at least $\frac{1}{15}\dbinom{n-2}{2}$ elements