document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=165380>Question 165380</A>: <I><SPAN STYLE=\"word-break: break-all;\"> If the police have 7 suspects, how many different ways can they select 5 for a lineup? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #121907 by </B><A HREF=/tutors/aboutme.mpl?userid=nerdybill><B>nerdybill(7384)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=nerdybill><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=nerdybill><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=121907\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\">     If the police have 7 suspects, how many different ways can they select 5 for a lineup?<BR>\n" );
document.write( ".<BR>\n" );
document.write( "Since it doesn't matter which order the suspects line up, it is a \"combination\" as opposed to a \"permutation\".<BR>\n" );
document.write( ".<BR>\n" );
document.write( "Combination:<BR>\n" );
document.write( "nCr = (n!)/[r!(n-r)!]<BR>\n" );
document.write( ".<BR>\n" );
document.write( "In our case:<BR>\n" );
document.write( "n = 7<BR>\n" );
document.write( "r = 5<BR>\n" );
document.write( ".<BR>\n" );
document.write( "nCr = (7!)/[5!(7-5)!]<BR>\n" );
document.write( "nCr = (7!)/[5!(2)!]<BR>\n" );
document.write( "nCr = (1*2*3*4*5*6*7)/[(1*2*3*4*5)(1*2)]<BR>\n" );
document.write( "Canceling like-terms:<BR>\n" );
document.write( "nCr = (6*7)/[(1*2)]<BR>\n" );
document.write( "nCr = (42)/(2)<BR>\n" );
document.write( "nCr = 21\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "  <BR>\n" );
document.write( "  </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );