Skip to main content

2010 AMC 10A Problem 20

Problem 20 of 25HarderAlgebraGeometryCounting & Probability

A fly trapped inside a cubical box with side length 11 meter decides to relieve its boredom by visiting each corner of the box. It will begin and end in the same corner and visit each of the other corners exactly once. To get from a corner to any other corner, it will either fly or crawl in a straight line. What is the maximum possible length, in meters, of its path?

Answer choices

Show solution

Solution

Note that all the paths the fly can take have lengths of 1,2,1, \sqrt2, or 3.\sqrt3. There are only 44 space diagonals in the cube, so at most 44 moves can have length 3.\sqrt3. The other 44 moves have length at most 2.\sqrt2. This upper bound is attainable, for example by alternating space diagonals and face diagonals around the vertices. The path has length 42+43. 4\sqrt2 + 4\sqrt3. Thus, D is the correct answer.

More practice

Concepts: cube geometry · graph theory · optimization

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.