document.write( "Question 1205769: a.) How many 6 letter arrangements are possible if TT must be grouped together using the lerters MATTER\r
\n" ); document.write( "\n" ); document.write( "b.) How many 6 letter arrangments are possible if MTTR must be together using the letters MATTER \n" ); document.write( "

Algebra.Com's Answer #842790 by math_helper(2461) $\"\"$ $\"About$

You can put this solution on YOUR website!


\n" );
document.write( "a)  Keeping TT together means the TT can be treated as if it is a 
\n" );
document.write( " single, unique,letter itself.  Call this {TT}, where the brackets are
\n" );
document.write( "used to indicate the letters that must be grouped.  \r
\n" );
document.write( "\n" );
document.write( "The number of arrangements is effectively the same as that of 5 unique
\n" );
document.write( "letters:  5! = 120.   So the number of SIX letter arrangements where TT
\n" );
document.write( "must stay together is .\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "b)  Keeping MTTR together --  I am assuming the letters {MTTR} themselves
\n" );
document.write( "can be shuffled but the four letters must remain together as a group.  
\n" );
document.write( "The letters {{MTTR},A,E} can be arranged in 3! = 6 ways and for EACH ONE 
\n" );
document.write( "of these arrangements, you can arrange {MTTR} in 4!/2! = 12 ways.  Thus 
\n" );
document.write( "there are 6*12 =  ways to arrange the  letters of MATTER, 
\n" );
document.write( "where the letters MTTR are kept together, but are shuffled amongst themselves. 
\n" );
document.write( "   
\n" );
document.write( " \n" );
document.write( "

\n" );