document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=84655>Question 84655</A>: <I><SPAN STYLE=\"word-break: break-all;\"> A bicycle lock consists of 4 spinners each numbered 0-8. How many different lock combinations could you make if you know the number aren't repeated? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #60965 by </B><A HREF=/tutors/aboutme.mpl?userid=rapaljer><B>rapaljer(4671)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=rapaljer><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=rapaljer><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=60965\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> If the numbers on the spinners cannot be repeated, then each time you set a number on a spinner, then you can't use that number again.  Therefore, there will be 8 possibilities on the first spinner, then (having used up one possibility) there will be 7 on the second spinner, 6 on the third spinner, and only 5 on the third.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "The number of possibilities will be <BR>\n" );
document.write( "8*7*6*5 = 1680 possible combinations.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "R^2 at SCC </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );