All positive divisors of a positive integer
are written on a blackboard. Two players
and
play the following game taking alternate moves. In the firt move, the player
erases
. If the last erased number is
, then the next player erases either a divisor of
or a multiple of
. The player who cannot make a move loses. Determine all numbers
for which
can win independently of the moves of
.











In each vertex of a regular
-gon, there is a fortress. At the same moment, each fortress shoots one of the two nearest fortresses and hits it. The result of the shooting is the set of the hit fortresses; we do not distinguish whether a fortress was hit once or twice. Let
be the number of possible results of the shooting. Prove that for every positive integer
,
and
are relatively prime.





Let
be a positive integer. A square
is partitioned into
unit squares. Each of them is divided into two triangles by the diagonal parallel to
. Some of the vertices of the unit squares are colored red in such a way that each of these
triangles contains at least one red vertex. Find the least number of red vertices.




