document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=473728>Question 473728</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how many different five character passwords can be formed from the lowercase letters of the alphabet if repetition in not allowed? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #324933 by </B><A HREF=/tutors/aboutme.mpl?userid=jorel1380><B>jorel1380(3719)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=jorel1380><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=jorel1380><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=324933\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> If repetition is not allowed, then the amount of combinations is:<BR>\n" );
document.write( "26x25x24x23x22=7,893,600 different combinations.. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );