Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2001 IMO Shortlist Problems/C2"

m (New page: == Problem == Let <math>n</math> be an odd integer greater than 1 and let <math>c_1, c_2, \ldots, c_n</math> be integers. For each permutation <math>a = (a_1, a_2, \ldots, a_n)</math> of <...)
 
(Put up a solution)
Line 3: Line 3:
  
 
== Solution ==
 
== Solution ==
−
{{solution}}
+
We shall prove this by contradiction. Assume that for some <math>n</math>-tuple of <math>c_i</math> there does not exist two permutations <math>a</math> and <math>b</math> of <math>\{ 1, 2, \ldots,n\}</math> such that <math>n!|S(a)-S(b)</math>. Note that there are <math>n!</math> distinct permutations of <math>\{1, 2, \ldots,n\}</math>, which means there are <math>n!</math> distinct sums <math>S(a)</math>. Since no two of them are congruent modulo <math>n!</math>, we have that the set of all <math>S(a)</math> for some <math>n</math>-tuple of <math>c_i</math> is a congruence class modulo <math>n!</math>. This means that the sum of every <math>S(a)</math> is congruent to <math>\sum_{i=0}^{n!-1}=\frac{(n!-1)n!}{2}</math>. However, that same sum is congruent to
 +
 
 +
<cmath>\sum_{i=1}^{n}\left(c_i\sum_{j=1}^{n} (n-1)!*a_j\right)=\sum_{i=1}^{n} c_i\cdot \frac{n(n+1)(n-1)!}{2}=\frac{c_i(n+1)!}{2}\bmod{n!}</cmath>
 +
 
 +
Note that <math>2|n+1</math>, so <math>n!|\frac{(n+1)!}{2}</math>, so <math>n!</math> divides the sum. However, the sum is also congruent to <math>\frac{(n!-1)n!}{2}</math> modulo <math>n!</math>, and <math>n!-1</math> is odd, so <math>n!</math> couldn't possibly divide the sum. This leads to a contradiction, so our previous assumption must be false. This proves the problem statement.
  
 
== Resources ==
 
== Resources ==

Revision as of 08:50, 31 August 2011

Problem

Let $n$ be an odd integer greater than 1 and let $c_1, c_2, \ldots, c_n$ be integers. For each permutation $a = (a_1, a_2, \ldots, a_n)$ of $\{1,2,\ldots,n\}$, define $S(a) = \sum_{i = 1}^n c_i a_i$. Prove that there exist permutations $a \neq b$ of $\{1,2,\ldots,n\}$ such that $n!$ is a divisor of $S(a) - S(b)$.

Solution

We shall prove this by contradiction. Assume that for some $n$-tuple of $c_i$ there does not exist two permutations $a$ and $b$ of $\{ 1, 2, \ldots,n\}$ such that $n!|S(a)-S(b)$. Note that there are $n!$ distinct permutations of $\{1, 2, \ldots,n\}$, which means there are $n!$ distinct sums $S(a)$. Since no two of them are congruent modulo $n!$, we have that the set of all $S(a)$ for some $n$-tuple of $c_i$ is a congruence class modulo $n!$. This means that the sum of every $S(a)$ is congruent to $\sum_{i=0}^{n!-1}=\frac{(n!-1)n!}{2}$. However, that same sum is congruent to

\[\sum_{i=1}^{n}\left(c_i\sum_{j=1}^{n} (n-1)!*a_j\right)=\sum_{i=1}^{n} c_i\cdot \frac{n(n+1)(n-1)!}{2}=\frac{c_i(n+1)!}{2}\bmod{n!}\]

Note that $2|n+1$, so $n!|\frac{(n+1)!}{2}$, so $n!$ divides the sum. However, the sum is also congruent to $\frac{(n!-1)n!}{2}$ modulo $n!$, and $n!-1$ is odd, so $n!$ couldn't possibly divide the sum. This leads to a contradiction, so our previous assumption must be false. This proves the problem statement.

Resources

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_IMO_Shortlist_Problems/C2&oldid=42082"