The length of each edge of a tetrahedron (four triangles -- six edges) is one unit long. An ant wants to make a path on the surface of the tetrahedron such that each of the four vertices can be reached from any other vertex. What is the shortest path the ant can make a path ?

[Previous]	Problem 1 (Pirate Problem)
[Next]	Problem 3 (Algebra Problem)
[Up]	October Problems
[Home]	Home Page
[Mail]	Send EMail to Maine Math Talent Search
[Contents]	Maine Math Talent Search Contents

Last modified on Tuesday, January 12, 1999