document.write( "Question 1148680: how many distinguishable permutations of letters are possible in the word ENGINEERING?
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #770030 by ikleyn(52776)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "In all, there are 11 letters in the word.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Of them, letter \"E\" has multiplicity 3;\r\n" );
document.write( "\r\n" );
document.write( "         letter \"N\" has multiplicity 3;\r\n" );
document.write( "\r\n" );
document.write( "         letter \"G\" has multiplicity 2;\r\n" );
document.write( " \r\n" );
document.write( "         letter \"I\" has multiplicity 2;\r\n" );
document.write( "\r\n" );
document.write( "         the last letter \"R\" has multiplicity 1.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The number of distinguishable permutations of letters is  \"11%21%2F%283%21%2A3%21%2A2%21%2A2%21%29\" = \"%2811%2A10%2A9%2A8%2A7%2A6%2A5%2A4%2A3%2A2%2A1%29%2F%286%2A6%2A2%2A2%29\" = 277200.    ANSWER\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Solved.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "See the lesson\r
\n" ); document.write( "\n" ); document.write( "    - Arranging elements of sets containing indistinguishable elements \r
\n" ); document.write( "\n" ); document.write( "in this site.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );