Maths Olympiad Prep

Library / /102 of 196

Geometry Difficulty 5.2 AIME, harder Prove it Soviet Union

Problem:

Prove that the sum of the lengths of the edges of a polyhedron is at least 3 times the greatest distance between two points of the polyhedron.

Solution

Solution:

If AA and BB are at the greatest distance, then they must be vertices. For suppose AA is not a vertex. Then there is a segment XYXY entirely contained in the polyhedron with AA as an interior point. But now at least one of angles BAXBAX, BAYBAY must be at least 9090^{\circ}. Suppose it is BAXBAX. Then BXBX is longer than BABA. Contradiction.

Take a plane through AA perpendicular to the line ABAB. Then the polyhedron must lie entirely on one side of the plane, for if ZZ lay on the opposite side to BB, then BZBZ would be longer than BABA. Now move the plane slightly towards BB keeping it perpendicular to ABAB. The intersection of the plane and the polyhedron must be a small polygon. The polygon must have at least 33 vertices, each of which must lie on an edge of the polyhedron starting at AA. Select three of these edges.

As the plane is moved further towards BB, the selected vertices may sometimes split into multiple vertices or they may sometimes coalesce. In the former case, just choose one of the daughter vertices. In the latter case, let OO be the point of intersection of the plane and ABAB. Let OO' be the point of intersection at the last coalescence (or AA if there was none). Then we have three paths along edges, with no edges in common, each of which projects onto OOO'O and hence has length at least OOO'O. Now select one or more new vertices to replace any lost through coalescence and repeat.

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.