document.write( "Question 1198366: How many different 4-letter permutations can be formed from the letters in the word REPRESENT?\r
\n" );
document.write( "\n" );
document.write( "I know that if I want deffrent letter it would be permutation
\n" );
document.write( "like 6P4 = 360\r
\n" );
document.write( "\n" );
document.write( "but how about the repeated letters like the E 3 times and r 2 times? \n" );
document.write( "
Algebra.Com's Answer #831945 by ikleyn(52810)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "How many different 4-letter permutations can be formed from the letters in the word REPRESENT? \n" ); document.write( "I know that if I want deffrent letter it would be permutation \n" ); document.write( "like 6P4 = 360 \n" ); document.write( "but how about the repeated letters like the E 3 times and r 2 times? \n" ); document.write( "~~~~~~~~~~~~~~~~~~~~\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "Since they want you use different letters with no repetition,\r\n" ); document.write( "you should first determine the number of different letters in the word REPRESENT.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "It is easy to do: the number of different letters is R + E + P + S + N + T = 6.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "Now you apply the method which you know, and you get this answer:\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( " the number of different 4-letter permutations is 6*5*4*3 = 360\r\n" ); document.write( "\r\n" ); document.write( " (four consecutive integer factors in descending order, starting from the number of 6).\r\n" ); document.write( "\r \n" ); document.write( "\n" ); document.write( "Solved, with complete explanations.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "--------------\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " Another interpretation is possible considering/allowing repeating letters.\r \n" ); document.write( "\n" ); document.write( " @ewatrr tried to implement it, but her calculations are erroneous.\r \n" ); document.write( "\n" ); document.write( " See my calculations for this case below.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "There are 6 different letters; of them, letter \"E\" has multiplicity 3\r\n" ); document.write( "and letter \"R\" has multiplicity 2.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "We have 360 permutations without repetition, as I counted above.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "Next, with 3 \"E\" and one single letter from remaining 5 letters {R,P,S,N,T} we have 5*4 = 20 additional permutations.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "Next, with 2 \"E\" and 2 \"R\", we have\r \n" ); document.write( "\n" ); document.write( "So, you have solutions for both possible interpretations.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |