document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=347994>Question 347994</A>: <I><SPAN STYLE=\"word-break: break-all;\"> The Student number at a University consists of 2 letters, followed by 4 digits followed by 2 letters.  How many different student numbers are possible if:<BR>\n" );
document.write( "a. Letters and digits cannot be repeated.<BR>\n" );
document.write( "b. Letters can be repeated, but digits cannot </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #248817 by </B><A HREF=/tutors/aboutme.mpl?userid=checkley77><B>checkley77(12844)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=checkley77><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/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=248817\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> a. 26*25*10*9*8*7*24*23=1,808,352,000 combinations without repeats.<BR>\n" );
document.write( "b. 26*26*10+9*8*7*26*26=2,303,159,040 combinations with only letter repeats. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );