MathDB

2013 Olympic Revenge

Part of Olympic Revenge

Subcontests

(5)
5
1

Problem 5, Olympic Revenge 2013

Consider nn lamps clockwise numbered from 11 to nn on a circle.
Let ξ\xi to be a configuration where 0n0 \le \ell \le n random lamps are turned on. A cool procedure consists in perform, simultaneously, the following operations: for each one of the \ell lamps which are turned on, we verify the number of the lamp; if ii is turned on, a signal of range ii is sent by this lamp, and it will be received only by the next ii lamps which follow ii, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed.
The example in attachment, for n=4n=4, ilustrates a configuration where lamps 22 and 44 are initially turned on. Lamp 22 sends signal only for the lamps 33 e 44, while lamp 44 sends signal for lamps 11, 22, 33 e 44. Therefore, we verify that lamps 11 e 22 received only one signal, while lamps 33 e 44 received two signals. Therefore, in the next configuration, lamps 11 e 44 will be turned on, while lamps 22 e 33 will be turned off.
Let Ψ\Psi to be the set of all 2n2^n possible configurations, where 0n0 \le \ell \le n random lamps are turned on. We define a function f:ΨΨf: \Psi \rightarrow \Psi where, if ξ\xi is a configuration of lamps, then f(ξ)f(\xi) is the configurations obtained after we perform the cool procedure described above.
Determine all values of nn for which ff is bijective.