document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=4565>Question 4565</A>: <I><SPAN STYLE=\"word-break: break-all;\"> What is the number of arrangements that can be made out of the letters of the words \"SUCCESS\" so that all the S do not come together? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #2095 by </B><A HREF=/tutors/aboutme.mpl?userid=khwang><B>khwang(438)</B></A><img src=\"/images/stars/stars-10.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=khwang><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=2095\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\">  Among \"SUCCESS\", there are 3 S, 2 C , 1 U & 1 E.<BR>\n" );
document.write( " <BR>\n" );
document.write( " So, there are 7!/(3! 2!) = (7*6*5*4)/2 = 420 possible arrangements<BR>\n" );
document.write( " <BR>\n" );
document.write( " When all 3 S come together , there are (1+2+1+1)!/2! = 5!/2! = 60\r<BR>\n" );
document.write( "\n" );
document.write( " Hence, there are 420-60 = 360 arrangements that all the S do not come together.\r<BR>\n" );
document.write( "\n" );
document.write( " Kenny<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );