Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2008 / Problems / Day 1, P6

IMC 2008 · Day 1 · P6

very hard

For a permutation σ=(i1,i2,…,in)\sigma = (i_1, i_2, \dots, i_n) of (1,2,…,n)(1, 2, \dots, n) define D(σ)=∑k=1n∣ik−k∣D(\sigma) = \sum\limits_{k=1}^{n} |i_k - k|. Let Q(n,d)Q(n, d) be the number of permutations σ\sigma of (1,2,…,n)(1, 2, \dots, n) with d=D(σ)d = D(\sigma). Prove that Q(n,d)Q(n, d) is even for d≥2nd \ge 2n.

Solution (official)

Consider the n×nn \times n determinant Δ(x)=∣1x…xn−1x1…xn−2⋮⋮⋱⋮xn−1xn−2…1∣\Delta(x) = \begin{vmatrix} 1 & x & \dots & x^{n-1} \\ x & 1 & \dots & x^{n-2} \\ \vdots & \vdots & \ddots & \vdots \\ x^{n-1} & x^{n-2} & \dots & 1 \end{vmatrix} where the ijij-th entry is x∣i−j∣x^{|i-j|}. From the definition of the determinant we get Δ(x)=∑(i1,…,in)∈Sn(−1)inv⁡(i1,…,in)xD(i1,…,in)\Delta(x) = \sum_{(i_1, \dots, i_n) \in S_n} (-1)^{\operatorname{inv}(i_1, \dots, i_n)} x^{D(i_1, \dots, i_n)} where SnS_n is the set of all permutations of (1,2,…,n)(1, 2, \dots, n) and inv⁡(i1,…,in)\operatorname{inv}(i_1, \dots, i_n) denotes the number of inversions in the sequence (i1,…,in)(i_1, \dots, i_n). So Q(n,d)Q(n, d) has the same parity as the coefficient of xdx^d in Δ(x)\Delta(x).

It remains to evaluate Δ(x)\Delta(x). In order to eliminate the entries below the diagonal, subtract the (n−1)(n-1)-th row, multiplied by xx, from the nn-th row. Then subtract the (n−2)(n-2)-th row, multiplied by xx, from the (n−1)(n-1)-th and so on. Finally, subtract the first row, multiplied by xx, from the second row. Δ(x)=∣1x…xn−2xn−1x1…xn−3xn−2⋮⋮⋱⋮⋮xn−2xn−3…1xxn−1xn−2…x1∣=⋯=∣1x…xn−2xn−101−x2…xn−3−xn−1xn−2−xn⋮⋮⋱⋮⋮00…1−x2x−x300…01−x2∣=(1−x2)n−1.\Delta(x) = \begin{vmatrix} 1 & x & \dots & x^{n-2} & x^{n-1} \\ x & 1 & \dots & x^{n-3} & x^{n-2} \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ x^{n-2} & x^{n-3} & \dots & 1 & x \\ x^{n-1} & x^{n-2} & \dots & x & 1 \end{vmatrix} = \dots = \begin{vmatrix} 1 & x & \dots & x^{n-2} & x^{n-1} \\ 0 & 1 - x^2 & \dots & x^{n-3} - x^{n-1} & x^{n-2} - x^n \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & \dots & 1 - x^2 & x - x^3 \\ 0 & 0 & \dots & 0 & 1 - x^2 \end{vmatrix} = (1 - x^2)^{n-1}. For d≥2nd \ge 2n, the coefficient of xdx^d is 0 so Q(n,d)Q(n, d) is even.

How the field did

contestants scored
255
average (of 20)
2.55
solved (≥ 80%)
11.0%
near-0 (≤ 10%)
82.4%
discrimination
0.47

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2017 · Day 1 · P4very hardavg 1.4/10 · solved 11% · near-0 81% · disc 0.52
IMC 2016 · Day 2 · P8very hardavg 2.1/10 · solved 10% · near-0 62% · disc 0.38
IMC 2003 · Day 2 · P10very hardavg 2.2/10 · solved 12% · near-0 67% · disc 0.46
combinatorics
IMC 2022 · Day 1 · P3very hardavg 2.3/10 · solved 12% · near-0 55% · disc 0.64