For a permutation σ=(i1,i2,…,in) of
(1,2,…,n) define
D(σ)=k=1∑n∣ik−k∣. Let Q(n,d) be the
number of permutations σ of (1,2,…,n) with
d=D(σ). Prove that Q(n,d) is even for d≥2n.
Solution (official)
Consider the n×n determinant
Δ(x)=1x⋮xn−1x1⋮xn−2……⋱…xn−1xn−2⋮1
where the ij-th entry is x∣i−j∣. From the definition of the
determinant we get
Δ(x)=(i1,…,in)∈Sn∑(−1)inv(i1,…,in)xD(i1,…,in)
where Sn is the set of all permutations of (1,2,…,n) and
inv(i1,…,in) denotes the number of
inversions in the sequence (i1,…,in). So Q(n,d) has the
same parity as the coefficient of xd in Δ(x).
It remains to evaluate Δ(x). In order to eliminate the entries
below the diagonal, subtract the (n−1)-th row, multiplied by x,
from the n-th row. Then subtract the (n−2)-th row, multiplied by
x, from the (n−1)-th and so on. Finally, subtract the first row,
multiplied by x, from the second row.
Δ(x)=1x⋮xn−2xn−1x1⋮xn−3xn−2……⋱……xn−2xn−3⋮1xxn−1xn−2⋮x1=⋯=10⋮00x1−x2⋮00……⋱……xn−2xn−3−xn−1⋮1−x20xn−1xn−2−xn⋮x−x31−x2=(1−x2)n−1.
For d≥2n, the coefficient of xd is 0 so 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.