document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1016893>Question 1016893</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Find the number of distinguishable permutations of the letters of the word EDUCATED. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #633310 by </B><A HREF=/tutors/aboutme.mpl?userid=Theo><B>Theo(13342)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Theo><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=Theo><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=633310\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> the word is educated.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "without any duplicates the number of permutations would be 8! because there are 8 letters.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "since 2 of the letters are duplicates, the formula becomes 8! / (2! * 2!) = 8! / 4\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "since 8! = 8*7*6*5*4*3*2*1, then 8! = 40320\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "8! / 4 becomes 40320 / 4 = 10080.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "here's a good reference.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "<a  rel=nofollow HREF= \"http://www.regentsprep.org/regents/math/algebra/apr2/LpermRep.htm\" target = \"_blank\">http://www.regentsprep.org/regents/math/algebra/apr2/LpermRep.htm</a> </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );