MathDB
n boys and n girls in a row, students get candies

Source: Vietnamese National Mathematical Olympiad 2012-P4

February 8, 2012
combinatorics unsolvedcombinatorics

Problem Statement

Let nn be a natural number. There are nn boys and nn girls standing in a line, in any arbitrary order. A student XX will be eligible for receiving mm candies, if we can choose two students of opposite sex with XX standing on either side of XX in mm ways. Show that the total number of candies does not exceed 13n(n2−1).\frac 13n(n^2-1).
Back to ProblemsView on AoPS