document.write( "Question 1191201: How many different permutations can be formed from the letters in the word \"essence\" \n" ); document.write( "
Algebra.Com's Answer #822990 by ikleyn(52803)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "How many different permutations can be formed from the letters in the word \"essence\"
\n" ); document.write( "~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "The word has 7 letters; of them,  \" e \"  has the multiplicity 3 and  \" s \"  has multiplicity 2.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Therefore, the formula for the number of distinguishable permutations / (arrangements) is\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "    \"7%21%2F%283%21%2A2%21%29\" = \"%287%2A6%2A5%2A4%2A3%2A2%2A1%29%2F%281%2A2%2A3%2A1%2A2%29\" = 420.    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( "To see many other similar  (and different)  solved problems,  look into 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" ); document.write( "
\n" );