document.write( "Question 1152093: How many distinguishable permutations are there of the letters in WOODCOCK? \n" ); document.write( "
Algebra.Com's Answer #774016 by ikleyn(52847)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "The word \"WOODCOCK\" has 8 letters.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Of them, letter \"O\" has the multiplicity of 3;\r\n" );
document.write( "\r\n" );
document.write( "         letter \"C\" has the multiplicity of 2;\r\n" );
document.write( "\r\n" );
document.write( "         the rest of the letters are unique.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Therefore, the number of all distinguishable permutations (they are also called \"distinguishable arrangements\") is\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "      \"8%21%2F%283%21%2A2%21%29\" = \"%281%2A2%2A3%2A4%2A5%2A6%2A7%2A8%29%2F%28%281%2A2%2A3%29%2A%281%2A2%29%29\" = 3360.    ANSWER\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "8! counts the number of all possible permutations of 8 letters.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "3! in the denominator stays to account for repeating letter \"O\".\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "2! in the denominator stays to account for repeating letter \"C\".\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Solved, answered and explained.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );