MathDB
Soviet Union 8

Source: IMO LongList 1959-1966 Problem 51

September 2, 2004
combinatoricsinvariantpermutationIMO ShortlistIMO Longlist

Problem Statement

Consider nn students with numbers 1,2,,n1, 2, \ldots, n standing in the order 1,2,,n.1, 2, \ldots, n. Upon a command, any of the students either remains on his place or switches his place with another student. (Actually, if student AA switches his place with student B,B, then BB cannot switch his place with any other student CC any more until the next command comes.)
Is it possible to arrange the students in the order n,1,2,,n1n,1, 2, \ldots, n-1 after two commands ?