document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=333367>Question 333367</A>: <I><SPAN STYLE=\"word-break: break-all;\"> In how many ways can the word SUNDAY be arranged.<BR>\n" );
document.write( "How many arrangements begin with S and do not end with Y? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #238880 by </B><A HREF=/tutors/aboutme.mpl?userid=jrfrunner><B>jrfrunner(365)</B></A><img src=\"/images/stars/stars-10.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=jrfrunner><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=jrfrunner><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=238880\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> assuming there are no duplicated letters, there are n! different ways of ordering a word with n letters<BR>\n" );
document.write( "----<BR>\n" );
document.write( "the word SUNDAY be arranged in 6!=6*5*4*3*2=720 ways<BR>\n" );
document.write( "---<BR>\n" );
document.write( "The are 5! ways of ordering the word SUNDAY if the first letter is rstricted to S, because only the 5 remaining ones are allowed to change.<BR>\n" );
document.write( "There are 4! ways of ordering the word SUNDAY if the first letter is restricted to S \"and\" the last letter is restricted to Y<BR>\n" );
document.write( "--<BR>\n" );
document.write( "Therefore, there are 5!-4! ways that the word SUNDAY can be arranged such that the first letter is S and the last letter \"is not\" Y<BR>\n" );
document.write( "5!-4! = 120-24 =96<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );