document.write( "Question 1181720: 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
\n" );
document.write( "\n" );
document.write( "[asy]
\n" );
document.write( "import three;\r
\n" );
document.write( "\n" );
document.write( "size(150);\r
\n" );
document.write( "\n" );
document.write( "currentprojection=orthographic(1/4,-1,1/2);\r
\n" );
document.write( "\n" );
document.write( "triple A, B, C, D, E, F;\r
\n" );
document.write( "\n" );
document.write( "A = (0,0,0.5);
\n" );
document.write( "B = (0.5,0,0);
\n" );
document.write( "C = (0,0.5,0);
\n" );
document.write( "D = (-0.5,0,0);
\n" );
document.write( "E = (0,-0.5,0);
\n" );
document.write( "F = (0,0,-0.5);\r
\n" );
document.write( "\n" );
document.write( "draw(A--B--F--D--cycle);
\n" );
document.write( "draw(B--E--D);
\n" );
document.write( "draw(B--C--D,dashed);
\n" );
document.write( "draw(A--E--F);
\n" );
document.write( "draw(A--C--F,dashed);\r
\n" );
document.write( "\n" );
document.write( "[/asy]\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "IT IS IN LATEX SRY \n" );
document.write( "
Algebra.Com's Answer #811646 by ikleyn(52786)![]() ![]() You can put this solution on YOUR website! .\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Please re-post and explain how your drawings do relate to the problem.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "If you can, upload your picture to some specialized web-site and provide a link to it . . . \r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |