A token is placed at each vertex of a regular 2n-gon. A move consists in choosing an edge of the 2n-gon and swapping the two tokens placed at the endpoints of that edge. After a finite number of moves have been performed, it turns out that every two tokens have been swapped exactly once. Prove that some edge has never been chosen. geometrygeometric transformationreflectioncombinatorics