Problem:
A polygonal line connects two opposite vertices of a cube with side . Each segment of the line has length and each vertex lies on the faces (or edges) of the cube. What is the smallest number of segments the line can have?
Problem:
A polygonal line connects two opposite vertices of a cube with side . Each segment of the line has length and each vertex lies on the faces (or edges) of the cube. What is the smallest number of segments the line can have?
Solution:
Answer

Suppose one endpoint of a segment length is at . Evidently the other end could be at the edge midpoints , , . It could also be on the circular arc connecting and (with center and radius ). Similarly, it could be on arcs connecting and , or and . We claim that if is a point of one of these arcs other than its endpoints, then the only possible segment length with an endpoint at (and the other endpoint on the surface of the cube) is . Without loss of generality we can consider to be on the arc . Take axes with origin , so that is . Suppose is and that the other endpoint of the segment is . Then
But , since is not an endpoint of the arc, so and are both positive. Hence with equality iff . Similarly, with equality iff . Hence with equality iff , which proves the claim.
Thus if the next link of the polygonal line goes from to anywhere except , , , then it has to go back to . So a minimal line must go to , , or .
Now from the line can only go to or . For if it goes to , then we have
with equality iff , and or .
So let us take as the starting point of the polygonal line. Without loss of generality the first segment is . Then the second segment must be (for a minimal line). Thus the best we can do with segments is to move along an edge. It takes three such moves to get to the opposite corner, and hence at least segments. But it is obvious that it can be done with segments.