MathDB
set of n numbered lights

Source: 2011 Portugal (OPM) p3

May 20, 2024
combinatorics

Problem Statement

A set of nn lights, numbered 11 to nn, are initially off. At every moment, it is possible to perform one of the following operations: \bullet change the state of lamp 11, \bullet change the state of lamp 22, as long as lamp 11 is on, \bullet change the state of lamp k>2k > 2, as long as lamp k1k - 1 is on and all lamps 1,...,k21, . . . , k - 2 are off. It shows that it is possible, after a certain number of operations, to have only the lamp left on.