Difference between revisions of "1993 IMO Problems/Problem 6"
(Created page with "==Problem == There are <math>n</math> lamps <math>L_0, \ldots , L_{n-1}</math> in a circle (<math>n > 1</math>), where we denote <math>L_{n+k} = L_k</math>. (A lamp at all tim...") |
|||
| Line 11: | Line 11: | ||
== Solution == | == Solution == | ||
{{solution}} | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=1993|num-b=5|after=Last Problem}} | ||
Latest revision as of 10:31, 21 November 2023
Problem
There are 
lamps 
in a circle (
), where we denote 
. (A lamp at all times is either on or off.) Perform steps 
as follows: at step 
, if 
is lit, switch 
from on to off or vice versa, otherwise do nothing. Initially all lamps are on. Show that:
(a) There is a positive integer 
such that after steps all the lamps are on again;
(b) If 
, we can take 
;
(c) If 
, we can take 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1993 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Problem |
| All IMO Problems and Solutions | ||
