document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1191460>Question 1191460</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Topics In Contemporary Math<BR>\n" );
document.write( "    <BR>\n" );
document.write( "Permutations and Combinations\r<BR>\n" );
document.write( "\n" );
document.write( "QUESTION 8\r<BR>\n" );
document.write( "\n" );
document.write( "A password must have a very specific format.  It must have a capital letter from the English alphabet, then a single digit, then a special character chosen from ! @ # $ % & ? or _, then three additional letters that can be either capital OR lowercase.  Assuming the letters can be repeated, how many passwords are possible?  </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #823565 by </B><A HREF=/tutors/aboutme.mpl?userid=Boreal><B>Boreal(15235)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Boreal><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=Boreal><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=823565\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> 26 ways for the first<BR>\n" );
document.write( "10 ways for the digit<BR>\n" );
document.write( "8 ways for the special character<BR>\n" );
document.write( "52^3 ways for three letters that can be capital or lowercase <BR>\n" );
document.write( "The product is 292,464,640 different ways </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );