GeometryDifficulty 5.9AIME, harderFind the answerItaly
Problem:
A regular hexagon of side 1 is given. Consider an equilateral triangle of side 1 inside the hexagon, with two vertices constrained to the perimeter of the hexagon. We move the equilateral triangle so that one of the two constrained vertices travels exactly once around the perimeter of the hexagon. What is the length traveled by the unconstrained vertex?
Pick one
Solution
Solution:
The answer is (C). We show that, in moving the first constrained vertex of the triangle from one end to the other of a single side of the hexagon, the unconstrained vertex travels back and forth along a segment of length 323−1.
Indeed, let ABCDEF be the hexagon, let O be its center; let G and H be on segments AB and BC, respectively, such that GH=AB, and let R be the point on the same side of O with respect to the line GH such that GHR is an equilateral triangle. We want to show that R lies on the line OB.
We note that the quadrilateral GBHR is cyclic, since the sum of the angles GBH=120∘ and GRH=60∘ is a straight angle. It follows that GBR=GHR=60∘, hence GBR=GBO as desired. We also compute the distance of R from O in the case where GH is orthogonal to BO (that is, H is the reflection of G with respect to that line). In this case, letting K be the point of intersection between BO and GH, the triangles KGB and KHB are congruent and right-angled, each being half of an equilateral triangle, hence BK=31, GK=63. Since RK=23 and OB=1, we have RO=RK−(OB−BK)=233−1.
It follows that, as a constrained vertex of the right triangle moves from A to B and the second constrained vertex from B to C, the unconstrained vertex travels back and forth along a segment OX of length 233−1. In total, the length traveled by the unconstrained vertex is 12⋅OX=83−12.
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 translated into English from it; metadata (topic, difficulty) added by this project.