A function $f : \mathbb{Z}_+ \to \mathbb{Z}_+$, where $\mathbb{Z}_+$ is the set of positive integers, is non-decreasing and satisfies $f(mn) = f(m)f(n)$ for all relatively prime positive integers $m$ and $n$. Prove that $f(8)f(13) \ge (f(10))^2$.

Three circles $\Gamma_A$, $\Gamma_B$ and $\Gamma_C$ share a common point of intersection $O$. The other common point of $\Gamma_A$ and $\Gamma_B$ is $C$, that of $\Gamma_A$ and $\Gamma_C$ is $B$, and that of $\Gamma_C$ and $\Gamma_B$ is $A$. The line $AO$ intersects the circle $\Gamma_A$ in the point $X \ne O$. Similarly, the line $BO$ intersects the circle $\Gamma_B$ in the point $Y \ne O$, and the line $CO$ intersects the circle $\Gamma_C$ in the point $Z \ne O$. Show that \[\frac{|AY |\cdot|BZ|\cdot|CX|}{|AZ|\cdot|BX|\cdot|CY |}= 1.\]

Laura has $2010$ lamps connected with $2010$ buttons in front of her. For each button, she wants to know the corresponding lamp. In order to do this, she observes which lamps are lit when Richard presses a selection of buttons. (Not pressing anything is also a possible selection.) Richard always presses the buttons simultaneously, so the lamps are lit simultaneously, too. a) If Richard chooses the buttons to be pressed, what is the maximum number of different combinations of buttons he can press until Laura can assign the buttons to the lamps correctly? b) Supposing that Laura will choose the combinations of buttons to be pressed, what is the minimum number of attempts she has to do until she is able to associate the buttons with the lamps in a correct way?

A positive integer is called simple if its ordinary decimal representation consists entirely of zeroes and ones. Find the least positive integer $k$ such that each positive integer $n$ can be written as $n = a_1 \pm a_2 \pm a_3 \pm \cdots \pm a_k$ where $a_1, \dots , a_k$ are simple.