IMO 1993 Problem 6
- Day 2
- Difficulty band 9
There are n > 1 lamps , , ... , in a circle. We use to mean . A lamp is at all times either on or off. Initially they are all on. Perform steps , , ... as follows: at step , if is lit, then switch 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 = , then we can take M(n) = - 1. (c) If n = + 1, then we can take M(n) = - 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.
Similar problems
These problems have the most words in common with this statement.