Page 1 of 1

Initial order of first $n$ numbers

Posted: Sun Aug 09, 2015 9:42 pm
by Masum
The integers $1,...,n$ are arranged in any order. In one step any two neighboring integers may be interchanged. Prove that the initial order can never be reached after an odd number of steps.

Re: Initial order of first $n$ numbers

Posted: Sun Aug 09, 2015 10:07 pm
by *Mahi*
Hint:
There is a parity of every permutation: try to define it in useful terms.