Given a finite set B of points in space, any two distances between the points of this set are different. Each point of the set B is connected by a line segment to the closest point of the set B. This way we will get a set of sections, one of which (any chosen one) we paint red, all the remaining sections we paint green. Prove that there are two points of the set B that cannot be connected by a line composed of green segments. geometrycombinatoricscombinatorial geometry3D geometry