View source

=Problem==
Let <math>n_1, n_2, \dots , n_m</math> be integers where <math>m>1</math> is odd. Let <math>x = (x_1, \dots , x_m)</math> denote a permutation of the integers <math>1, 2, \cdots , m</math>. Let <math>f(x) = x_1n_1 + x_2n_2 + ... + x_mn_m</math>. Show that for some distinct permutations <math>a</math>, <math>b</math> the difference <math>f(a) - f(b)</math> is a multiple of <math>m!</math>.

==Solution==
Notice that if <math>\{0,1,2,...,m!-1\}\not=\{f(1),f(2),f(3),...,f(m!)\}\pmod{m!}</math> then by the pigeon hole princible, there must be some <math>a,b\in\{1,2,...,m!\}</math> such that <math>f(a)\equiv f(b)\pmod{m!}</math> as desired.  Thus, we must prove that <math>\{0,1,2,...,m!-1\}\not=\{f(1),f(2),f(3),...,f(m!)\}\pmod{m!}</math>.  Suppose there was such a situation.  Then, since the two sets have the same number of elements, for every <math>t\in\{0,1,...,m!-1\}</math>, there exists a <math>v\in\{1,2,...,m!\}</math> such that <math>t\equiv f{v}\pmod{m!}</math>.  So, let <math>t\equiv f(v_t)\pmod{m!}</math>.  Consider the sum <math>f(v_0)+f(v_1)+\cdots+f(v_{m!-1})\pmod{m!}</math>.  Using the fact that <math>f(v_t)\equiv t\pmod{m!}</math>, we find the sum is congruent to <math>0+1+\cdots+m!-1=\frac{m!(m!-1)}{2}</math>.  

On the other hand, using the fact that <math>f(x)=x_1n_1 + x_2n_2 + ... + x_mn_m</math>, we can combine the terms with the same coefficient (<math>n_i</math>).  For each <math>n_1</math>, since all the <math>v_j</math> are distinct, the coefficient in the sum would be <math>\sum x_i</math> over all permutations <math>x</math> of <math>\{1,2,...,m\}</math>.  Thus, the coefficient would be <math>\sum_{i=1}^m i(m-1)!=\frac{m!(m+1)}{2}</math>.  Since <math>m</math> is odd, <math>\frac{m+1}{2}</math> is an integer, so the coefficient is congruent to <math>0\pmod{m!}</math>.  Thus, the whole sum is congruent to <math>0\pmod{m!}</math>.  Therefore, <math>\frac{m!(m!-1)}{2}\equiv0\pmod{m!}</math>.  But, since <math>m>1</math>, we have <math>m!</math> is even, and thus <math>m!-1</math> is odd.  Therefore, the integer <math>\frac{m!(m!-1)}{2}</math> has one factor of <math>2</math> less than <math>m!</math> does.  Contradiction!
==See also==
{{IMO box|num-b=3|num-a=5|year=2001}}
[[Category:Olympiad Combinatorics Problems]]