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 <...) |
(No difference)
|
Revision as of 17:19, 20 August 2008
Problem
Let 
be an odd integer greater than 1 and let 
be integers. For each permutation 
of 
, define 
. Prove that there exist permutations 
of such that 
is a divisor of 
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
