MathDB
China Mathematics Olympiads (National Round) 2007 Problem 3

Source:

November 28, 2010
combinatorics unsolvedcombinatorics

Problem Statement

Let a1,a2,,a11a_1, a_2, \ldots , a_{11} be 11 pairwise distinct positive integer with sum less than 2007. Let S be the sequence of 1,2,,20071,2, \ldots ,2007. Define an operation to be 22 consecutive applications of the following steps on the sequence SS: on ii-th step, choose a number from the sequense SS at random, say xx. If 1i111 \leq i \leq 11, replace xx with x+aix+a_i ; if 12i2212 \leq i \leq 22, replace xx with xai11x-a_{i-11} . If the result of operation on the sequence SS is an odd permutation of {1,2,,2007}\{1, 2, \ldots , 2007\}, it is an odd operation; if the result of operation on the sequence SS is an even permutation of {1,2,,2007}\{1, 2, \ldots , 2007\}, it is an even operation. Which is larger, the number of odd operation or the number of even permutation? And by how many?
Here {x1,x2,,x2007}\{x_1, x_2, \ldots , x_{2007}\} is an even permutation of {1,2,,2007}\{1, 2, \ldots ,2007\} if the product i>j(xixj)\prod_{i > j} (x_i - x_j) is positive, and an odd one otherwise.