document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1210199>Question 1210199</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Find the number of sequences (a_1, a_2, a_3, \dots, a_8) such that:<BR>\n" );
document.write( "* a_i \in \{1, 2, 3, 4, 5, 6, 7, 8\} for all 1 \le i \le 8.<BR>\n" );
document.write( "* Every number1, 2, 3, 4, 5, 6, 7, 8 appears at least once in the sequence. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #851550 by </B><A HREF=/tutors/aboutme.mpl?userid=greenestamps><B>greenestamps(13200)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=greenestamps><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=greenestamps><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=851550\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <br><BR>\n" );
document.write( "The sequence has 8 terms; each term is an integer from 1 to 8 inclusive; and the sequence must contain each of those integers at least once.<br><BR>\n" );
document.write( "That means the sequence contains each of those integers EXACTLY once.  So the number of sequences is simply the number of arrangements of the 8 integers, which is 8! = 40,320.<br><BR>\n" );
document.write( "ANSWER: 40,320<br><BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );