document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1182459>Question 1182459</A>: <I><SPAN STYLE=\"word-break: break-all;\"> If the bottom face of a pyramid has n sides, how many faces, edges, and vertices will it<BR>\n" );
document.write( "have? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #812506 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13203)</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=812506\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "Draw a picture, at least in your mind....<br><BR>\n" );
document.write( "Vertices: n sides on the base, so there are n vertices on the base; then just one more -- the peak of the pyramid.<BR>\n" );
document.write( "ANSWER: (n+1) vertices<br><BR>\n" );
document.write( "Edges: n sides of the base, each of which is an edge of the pyramid; then one edge from each of the n base vertices to the peak.<BR>\n" );
document.write( "ANSWER: n+n=2n edges<br><BR>\n" );
document.write( "Faces: the base, plus n triangular faces.<BR>\n" );
document.write( "ANSWER: (n+1) faces.<br><BR>\n" );
document.write( "Note those numbers satisfy the Euler formula:<br><BR>\n" );
document.write( "edges = faces plus vertices minus 2<br><BR>\n" );
document.write( "2n = (n+1)+(n+1)-2<br><BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );