wiz-icon
MyQuestionIcon
MyQuestionIcon
6
You visited us 6 times! Enjoying our articles? Unlock Full Access!
Question

Let n be an odd integer greater than 1 and let c1,c2,,cn be integers. For each permutation a=(a1,a2,,an) of (1,2,,n) define S(a)=ni=1ciai.Prove that there exist permutations ab of {1,2,,n} such that n! is a divisor of S(a)-S(b).

A
12n!(n!1)12(n+1)!ni=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.
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B
12n!(n!+1)12(n+1)!ni=1c0(modn!). Because n>1 is odd, the right-hand side is congruent to 0 mod n!, while the lefthand side is not, a contradiction.
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
12n!(n!1)12(n1)!ni=1c0(modn!). Because n>1 is odd, the right-hand side is congruent to 0 mod n!, while the lefthand side is not, a contradiction.
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
None of the above
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B 12n!(n!1)12(n+1)!ni=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)=ani=1cici=ni=1ciaai. For each i, in aai, each of the numbers 1, 2, ..., n, appears (n-1)! times, hence aai=(n1)!(1+2++n)=12(n+1)!.It follows that aS(a)=12(n+1)!ni=1ci. We deduce that 12n!(n!1)12(n+1)!ni=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.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Permutations
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon