document.write( "Question 1046387: How many different permutations can be formed using all the letters in the word MASSACHUSETTS?
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #661858 by ikleyn(52908)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "How many different permutations can be formed using all the letters in the word MASSACHUSETTS?
\n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\r\n" );
document.write( "The word MASSACHUSETTS contains 13 letters, of them \"S\" is repeating 4 times, \"A\" is repeating 2 times, \"T\" is repeating twice. \r\n" );
document.write( "The remaining letters are unique.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "13 symbols create 13! permutations.\r\n" );
document.write( "\r\n" );
document.write( "Of them, the number of distinguishable permutations is \"13%21%2F%284%212%212%21%29\" = \"%2813%2A12%2A11%2A10%2A9%2A8%2A7%2A6%2A5%29%2F%282%2A2%29\" = 13*12*11*10*9*2*7*6*5 = 64864800.\r\n" );
document.write( "\r\n" );
document.write( "We divide 13! by k! for each symbol in the word repeating k times.\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "Read also under this link\r
\n" ); document.write( "\n" ); document.write( "https://www.algebra.com/algebra/homework/word/misc/Miscellaneous_Word_Problems.faq.question.1026495.html\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "https://www.algebra.com/algebra/homework/word/misc/Miscellaneous_Word_Problems.faq.question.1026495.html\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );