document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=285006>Question 285006</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how many different 3-letter passwords are possible if no letter can be repeated? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #206755 by </B><A HREF=/tutors/aboutme.mpl?userid=toidayma><B>toidayma(44)</B></A><img src=\"/images/stars/stars-07.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=toidayma><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=toidayma><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=206755\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Let (xyz) the possible password. Since no letter can be repeated, x <> y <> z.<BR>\n" );
document.write( "Now, how many ways to pick a letter for x: 26 (since there are 26 different letters in the alphabet). After picking x, the number of letters left to chose y is: 25. Also, after picking two letters for x and y, there are 24 ways left to pick for z.<BR>\n" );
document.write( "So, there are total 26*25*24 possible values of (xyz). </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );