document.write( "Question 1072407: how many distinct permutations can be formed from all the letters of the word SUCCESS
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #687330 by Edwin McCravy(20059)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "The word SUCCESS is a 7-letter word. The answer would be 7! \r\n" ); document.write( "for a 7-letter word like PAINTER, for you can tell all those \r\n" ); document.write( "letters apart. But in SUCCESS, the 3 S's cannot be told apart,\r\n" ); document.write( "nor can the 2 C's. So we must divide 7! by the number of ways \r\n" ); document.write( "the 3 S's could be arranged in each permutation, which is 3!, \r\n" ); document.write( "as well as divided by the number of ways the two C's could be \r\n" ); document.write( "arranged, which is 2!.\r\n" ); document.write( "\r\n" ); document.write( "Answer:\n" ); document.write( " |