document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1181720>Question 1181720</A>: <I><SPAN STYLE=\"word-break: break-all;\"> A regular octahedron is made up of eight equilateral triangles, each with side length one unit, as shown below. An ant starts at the top vertex, walks along the edges of the triangles without ever traversing the same edge twice, and ends at the top vertex. If she did not pass through the top vertex at any other point in her walk, how many units are in the maximum distance she could walk?\r<BR>\n" );
document.write( "\n" );
document.write( "[asy]<BR>\n" );
document.write( "import three;\r<BR>\n" );
document.write( "\n" );
document.write( "size(150);\r<BR>\n" );
document.write( "\n" );
document.write( "currentprojection=orthographic(1/4,-1,1/2);\r<BR>\n" );
document.write( "\n" );
document.write( "triple A, B, C, D, E, F;\r<BR>\n" );
document.write( "\n" );
document.write( "A = (0,0,0.5);<BR>\n" );
document.write( "B = (0.5,0,0);<BR>\n" );
document.write( "C = (0,0.5,0);<BR>\n" );
document.write( "D = (-0.5,0,0);<BR>\n" );
document.write( "E = (0,-0.5,0);<BR>\n" );
document.write( "F = (0,0,-0.5);\r<BR>\n" );
document.write( "\n" );
document.write( "draw(A--B--F--D--cycle);<BR>\n" );
document.write( "draw(B--E--D);<BR>\n" );
document.write( "draw(B--C--D,dashed);<BR>\n" );
document.write( "draw(A--E--F);<BR>\n" );
document.write( "draw(A--C--F,dashed);\r<BR>\n" );
document.write( "\n" );
document.write( "[/asy]\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "IT IS IN LATEX SRY </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #811680 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13200)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=greenestamps><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=greenestamps><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=811680\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "The octahedron has 8 faces, 6 vertices, and 12 edges; there are 4 edges meeting at each of the 6 vertices.<br><BR>\n" );
document.write( "Since the ant starts and ends at the top vertex and can't pass through that vertex during her walk, her trip can only travel on 2 of the 4 edges that meet at the top vertex.  So the maximum POSSIBLE number of edges she can travel on her walk is 10.<br><BR>\n" );
document.write( "And by trial and error, paths can be found on which she in fact travels the other 10 edges.<br><BR>\n" );
document.write( "So the maximum distance she can cover in her walk is 10 units.<br><BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );