Subcontests
(6)Permutations of (1,2,...,2015)
Given a 2015-tuple (a1,a2,…,a2015) in each step we choose two indices 1≤k,l≤2015 with ak even and transform the 2015-tuple into (a1,…,2ak,…,al+2ak,…,a2015). Prove that starting from (1,2,…,2015) in finite number of steps one can reach any permutation of (1,2,…,2015).