Consider the segment [0;1]. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed 1/2.Mikhail Lukin combinatoricsTournament of TownsProcessKvant