Let n be a natural number. There are n boys and n girls standing in a line, in any arbitrary order. A student X will be eligible for receiving m candies, if we can choose two students of opposite sex with X standing on either side of X in m ways. Show that the total number of candies does not exceed 31n(n2−1). combinatorics unsolvedcombinatorics