Let
![A](/media/m/5/a/e/5ae81275ee67d638485e903bdc0e9cde.png)
be a set of
![n](/media/m/a/e/5/ae594d7d1e46f4b979494cf8a815232b.png)
points in space. From the family of all segments with endpoints in
![A](/media/m/5/a/e/5ae81275ee67d638485e903bdc0e9cde.png)
,
![q](/media/m/c/1/d/c1db9b1124cc69b01f9a33595637de69.png)
segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of
![m](/media/m/1/3/6/1361d4850444c055a8a322281f279b39.png)
yellow segments, where
![m \geq \frac{2q}{n}](/media/m/6/2/9/629db9208fe5c8e7f86eca273f6debf8.png)
, arranged in order of increasing length.
%V0
Let $A$ be a set of $n$ points in space. From the family of all segments with endpoints in $A$, $q$ segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of $m$ yellow segments, where $m \geq \frac{2q}{n}$ , arranged in order of increasing length.