MathDB
lamps go on and off

Source: Tournament of Towns,Spring 2002, Junior A Level, P4

May 13, 2014
combinatorics proposedcombinatorics

Problem Statement

There are nn lamps in a row. Some of which are on. Every minute all the lamps already on go off. Those which were off and were adjacent to exactly one lamp which was on will go on. For which nn one can find an initial configuration of lamps which were on, such that at least one lamp will be on at any time?