2018 Portugal MO

Day 1

1

Arthur thought of a positive integer and noticed that the sum of its three smallest divisors is $17$ and that the sum of its three largest divisors is $3905$. Indicate all the numbers that Arthur may have thought of.

2

In the figure, $[ABCD]$ is a square of side $1$. The points $E, F, G$ and $H$ are such that $[AFB], [BGC], [CHD]$ and $[DEA]$ are right-angled triangles. Knowing that the circles inscribed in each of these triangles and the circle inscribed in the square $[EFGH]$ has all the same radius, what is the measure of the radius of the circles?

3

How many ways are there to paint an $m \times n$ board, so that each square is painted blue, white, brown or gold, and in each $2 \times 2$ square there is one square of each color?

Day 2

4

Let $[ABC]$ be any triangle and let $D, E$ and $F$ be the symmetrics of the circumcenter wrt the three sides. Prove that the triangles $[ABC]$ and $[DEF]$ are congruent.

5

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of $7$ consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.

6

A triangle is divided into nine smaller triangles, where counters with the number zero are placed at each of the ten vertices. A movement consists of choosing one of the nine triangles and applying the same operation to the three counters of that triangle: adding a unit or subtracting a unit. The figure illustrates a possible movement. We shall call the integer number n dominant if it is possible, after a few moves, to obtain a configuration in which the counter numbers are all consecutive and the largest of these numbers is $n$. Determine all dominant numbers.