document.write( "Question 1155819: How many distinct permutations can be formed using the letters of the word ​\"CHARACTER​\"? \n" ); document.write( "
Algebra.Com's Answer #778498 by ikleyn(52776)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "How many  \"highlight%28cross%28distinct%29%29%29\"  \"highlight%28cross%28permutations%29%29\"  distinguishable  arrangements  can be formed using the letters of the word ​\"CHARACTER​\"?
\n" ); document.write( "~~~~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "In all, there are 9 letters in the word.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Of them, letter \"C\" has multiplicity 2;\r\n" );
document.write( "\r\n" );
document.write( "         letter \"A\" has multiplicity 2;\r\n" );
document.write( "\r\n" );
document.write( "         letter \"R\" has multiplicity 2.\r\n" );
document.write( " \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( "The number of distinguishable arrangements of letters is  \"9%21%2F%282%21%2A2%21%2A2%21%29\" = \"%289%2A8%2A7%2A6%2A5%2A4%2A3%2A2%2A1%29%2F%282%2A2%2A2%29\" = 45360.    ANSWER\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Three times repeated factor 2! in the denominator is to account for three repeated letters \"C\", \"A\" and \"R\" with their multiplicities.\r\n" );
document.write( "
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "It is a standard method of solving such problems and a standard mantra to pronounce.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Memorize it (!)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "---------------------\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "To see other similar 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( "Also,  you have this free of charge online textbook in ALGEBRA-II in this site\r
\n" ); document.write( "\n" ); document.write( "    - ALGEBRA-II - YOUR ONLINE TEXTBOOK.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The referred lesson is the part of this online textbook under the topic  \"Combinatorics: Combinations and permutations\". \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Save the link to this textbook together with its description\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Free of charge online textbook in ALGEBRA-II
\n" ); document.write( "https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "into your archive and use when it is needed.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );