document.write( "Question 1159530: Consider the word AARDVARK\r
\n" );
document.write( "\n" );
document.write( "A) Determine all the permutations of all of the letters.\r
\n" );
document.write( "\n" );
document.write( "B) Determine all the permutations of the letters in which the three A's are together \n" );
document.write( "
Algebra.Com's Answer #782575 by greenestamps(13200)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "YOU can determine all the permutations if you want.... I will only describe how to find the NUMBER of permutations. \n" ); document.write( "A) All permutations.... \n" ); document.write( "There are 8 letters total; 3 are identical, and another 2 are identical. By a well-known counting principle, the number of permutations is \n" ); document.write( " \n" ); document.write( "B) If all three A's are together, treat them as a single \"letter\"; then there are 6 letters with just the two R's being identical. Again using the same counting principle, the number of permutations is \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |