Maths Olympiad Prep

Library / /163 of 196

Geometry Difficulty 6.0 AIME, harder Prove it Soviet Union

Problem:

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

Solution

Solution:

Answer 66

Figure 1

Suppose one endpoint of a segment length 33 is at AA. Evidently the other end could be at the edge midpoints BB, CC, DD. It could also be on the circular arc connecting BB and CC (with center OO and radius 5\sqrt{5}). Similarly, it could be on arcs connecting CC and DD, or BB and DD. We claim that if XX is a point of one of these arcs other than its endpoints, then the only possible segment length 33 with an endpoint at XX (and the other endpoint on the surface of the cube) is AXAX. Without loss of generality we can consider XX to be on the arc BCBC. Take axes with origin OO, so that AA is (0,0,2)(0,0,2). Suppose XX is (a,b,0)(a,b,0) and that the other endpoint of the segment is YY (x,y,z)(x,y,z). Then

XY2=(xa)2+(yb)2+z2=a2+b2+z2x(2ax)y(2by)=5+z2x(2ax)y(2by) XY^2 = (x - a)^2 + (y - b)^2 + z^2 = a^2 + b^2 + z^2 - x(2a - x) - y(2b - y) = 5 + z^2 - x(2a - x) - y(2b - y)

But aa, b>1b > 1 since XX is not an endpoint of the arc, so (2ax)(2a- x) and (2by)(2b- y) are both positive. Hence x(2ax)y(2by)0- x(2a- x) - y(2b- y) \leq 0 with equality iff x=y=0x = y = 0. Similarly, z24z^2 \leq 4 with equality iff z=2z = 2. Hence XY29XY^2 \leq 9 with equality iff Y=AY = A, which proves the claim.

Thus if the next link of the polygonal line goes from AA to anywhere except BB, CC, DD, then it has to go back to AA. So a minimal line must go to BB, CC, or DD.

Now from DD the line can only go to AA or OO. For if it goes to ZZ (x,y,z)(x,y,z), then we have
DZ2=(x2)2+(y2)2+(z1)222+22+12=32 DZ^2 = (x - 2)^2 + (y - 2)^2 + (z - 1)^2 \leq 2^2 + 2^2 + 1^2 = 3^2
with equality iff x=0x = 0, y=0y = 0 and z=0z = 0 or 22.

So let us take AA as the starting point of the polygonal line. Without loss of generality the first segment is ADAD. Then the second segment must be DODO (for a minimal line). Thus the best we can do with 22 segments is to move along an edge. It takes three such moves to get to the opposite corner, and hence at least 66 segments. But it is obvious that it can be done with 66 segments.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.