The correct option is B 12n!(n!−1)≡12(n+1)!n∑i=1ci(modn!). Because n>1 is odd, the right-hand side is congruent to 0 mod n!, while the lefthand side is not, a contradiction.
Denote by ∑aS(a) the sum of S(a) over all n! permutations of {1,2,⋯,n}. We compute ∑aS(a) (mod n!) in two ways. First, assuming that theconclusion is false, it follows that each S(a) has a differnt remainder mod n!, hencethese remainders are the numbers 0, 1, 2, ..., n!-1. It follows that ∑aS(a)≡12n!(n!−1)(modn!). On the other hand,∑aS(a)=∑an∑i=1cici=n∑i=1ci∑aai. For each i, in ∑aai, each of the numbers 1, 2, ..., n, appears (n-1)! times, hence ∑aai=(n−1)!(1+2+⋯+n)=12(n+1)!.It follows that ∑aS(a)=12(n+1)!n∑i=1ci. We deduce that 12n!(n!−1)≡12(n+1)!n∑i=1ci(modn!). Because n>1 is odd, the right-hand side is congruent to 0 mod n!, while the lefthand side is not, a contradiction.