document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1189014>Question 1189014</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Find the number n of distinct permutations that can be formed from all the letters of each word:<BR>\n" );
document.write( "a) THEM b) UNUSUAL c) SOCIOLOGICAL<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #820232 by </B><A HREF=/tutors/aboutme.mpl?userid=math_helper><B>math_helper(2461)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=math_helper><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=math_helper><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=820232\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> a) THEM<BR>\n" );
document.write( "Four unique letters ==>  4! = 4*3*2*1 = 24  unique arrangements\r<BR>\n" );
document.write( "\n" );
document.write( "b) UNUSUAL<BR>\n" );
document.write( "Seven letters where there are three U's, and four other letters.  In this case we can compute as if all seven letters are unique AND THEN divide by the number of arrangements of the 3 U's that are indistinguishable: <BR>\n" );
document.write( "   7! / (3!)  =  7*6*5*4*3*2*1 / (3*2*1) = 7*6*5*4 = 840\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "c) You should have enough to do this one. \r<BR>\n" );
document.write( "\n" );
document.write( "Since there are multiple letters with more than one appearance, you will divide by the product of all those arrangements (for example, for the word  REEPER,  you would have  6! / (3!*2!)   where the denominator comes from the 3 E's and 2 R's)    </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );