Subcontests
(3)17th ibmo - el salvador 2002/q6.
A policeman is trying to catch a robber on a board of 2001×2001 squares. They play alternately, and the player whose trun it is moves to a space in one of the following directions: ↓,→,↖.If the policeman is on the square in the bottom-right corner, he can go directly to the square in the upper-left corner (the robber can not do this). Initially the policeman is in the central square, and the robber is in the upper-left adjacent square. Show that:a) The robber may move at least 10000 times before the being captured.
b) The policeman has an strategy such that he will eventually catch the robber.Note: The policeman can catch the robber if he reaches the square where the robber is, but not if the robber enters the square occupied by the policeman. 17th ibmo - el salvador 2002.
The integer numbers from 1 to 2002 are written in a blackboard in increasing order 1,2,…,2001,2002. After that, somebody erases the numbers in the (3k+1)−th places i.e. (1,4,7,…). After that, the same person erases the numbers in the (3k+1)−th positions of the new list (in this case, 2,5,9,…). This process is repeated until one number remains. What is this number?