30 segments of lengths 1, √3, √5, √7, √9, ... ,√59 have been drawn on a blackboard. In each step, two of the segments are deleted and a new segment of length equal to the hypotenuse of the right triangle with legs equal to the two deleted segments is drawn. After 29 steps only one segment remains. Find the possible values of its length.
Let sqrt(m) and sqrt(n) be two arbitrary members of the set and apply the operation. The hypotenuse is them sqrt[sqrt(m)^2+sqrt(n)^2] = sqrt[m+n]. This is very simple, the operation just adds the two radicands.
So there is only one possible final segment, whose radicand is the sum of all the original radicands; specifically in this case the final segment equals sqrt[1+3+5+7+...+59] = sqrt[(1+59)*30/2] = sqrt[900] = 30.