« Vrati se
There are n markers, each with one side white and the other side black. In the beginning, these n markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if n - 1 is not divisible by 3.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2301IMO Shortlist 2009 problem C56
2184IMO Shortlist 2005 problem C35
2076IMO Shortlist 2001 problem C62
2075IMO Shortlist 2001 problem C56
1941IMO Shortlist 1996 problem C60
1862IMO Shortlist 1993 problem C50