document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=334111>Question 334111</A>: <I><SPAN STYLE=\"word-break: break-all;\"> How many distinguishable permutations of letters are possible in the word COMMITTEE<BR>\n" );
document.write( "Must show work </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #239381 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=239381\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> the word COMMITTEE has 9 letters so 9!= permutation of that word,b ut...<BR>\n" );
document.write( "since the letters M, T and E are repeated each twice, there will be words that are indestinguishable from each othe because one M is not different from the other M, and same for the T and E.<BR>\n" );
document.write( "--<BR>\n" );
document.write( "So we need to back these words out.<BR>\n" );
document.write( "---<BR>\n" );
document.write( "answer:  9!/(2!*2!*2!)= 45360 <BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );