olymmath

IMO 1993 Problem 6

There are n > 1 lamps L0L_0, L1L_1, ... , Ln−1L_{n-1} in a circle. We use Ln+kL_{n+k} to mean LkL_k. A lamp is at all times either on or off. Initially they are all on. Perform steps s0s_0, s1s_1, ... as follows: at step sis_i, if Li−1L_{i-1} is lit, then switch LiL_i from on to off or vice versa, otherwise do nothing. Show that: (a) There is a positive integer M(n) such that after M(n) steps all the lamps are on again; (b) If n = 2k2^k, then we can take M(n) = n2n^2 - 1. (c) If n = 2k2^k + 1, then we can take M(n) = n2n^2 - n + 1.

Community text Kalva (prase.cz mirror). Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator imo/1993/p6 · Tag VATEC4WQQ1 · Edit this page on GitHub · Keys: j next, k previous