Skip to main content
OlympiadHQ

Browse · MathNet

Print

Mathematica competitions in Croatia

Croatia counting and probability

Problem

A group of twenty children has ribbons. Each ribbon is being held at its ends by two children. Two children may hold together at most one ribbon. Let us assume that a pair of ribbons such that its four ends hold different children can be chosen in ways. Prove that each child holds the same number of ribbons. (Iran 2003)
Solution
We enumerate the children by numbers . Let us denote by the number of ribbons that are being held by the child with number . Since each ribbon is being held by two children we have that The number of all pairs of ribbons is . A pair of ribbons such that its four ends are not being held by different children is given by a pair of ribbons such that there is a child who holds one end of each of the two ribbons in that pair. Hence From here it follows that By the AM–QM inequality we have Since the equality in AM–QM inequality is obtained if and only if all are equal, the claim follows.

Techniques

Counting two waysQM-AM-GM-HM / Power Mean