document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=651790>Question 651790</A>: <I><SPAN STYLE=\"word-break: break-all;\"> This question has two parts.  Given a list of 6 students (i.e. Mary, Sue, Anna, Bob, Sam, John) how many different ways can they be arranged in order first to last with no repeats?  I figured out that there would be 720 possible arrangements 6*5*4*3*2*1=720 different combinations.  But I don't know how to figure out the second part of the question which is, \"What are the number of times Anna will be listed first out of the six names? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #407813 by </B><A HREF=/tutors/aboutme.mpl?userid=jim_thompson5910><B>jim_thompson5910(35256)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=jim_thompson5910><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/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=407813\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> First part is correct.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Second part:\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Anna is locked in the first slot. So you have 6-1 = 5 students and 6-1 = 5 slots left.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "So there are 5! = 120 ways to do this. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );