document.write( "Question 122836: How many permutations of the leters ABCDEFG contain
\n" ); document.write( "(a)the string BCD
\n" ); document.write( "(b)the string CFGA
\n" ); document.write( "(c)the string BA & GF
\n" ); document.write( "(d)the string ABC & DE
\n" ); document.write( "(e)the string CBA & BED
\n" ); document.write( "

Algebra.Com's Answer #90172 by stanbon(75887)\"\" \"About 
You can put this solution on YOUR website!
When a string of letters must remain intact the string can be
\n" ); document.write( "treated as a single leter
\n" ); document.write( "-----------------------
\n" ); document.write( "How many permutations of the leters ABCDEFG contain
\n" ); document.write( "(a)the string BCD
\n" ); document.write( "5!
\n" ); document.write( "-----------
\n" ); document.write( "(b)the string CFGA
\n" ); document.write( "4!
\n" ); document.write( "--------
\n" ); document.write( "(c)the string BA & GF
\n" ); document.write( "5!
\n" ); document.write( "-----------
\n" ); document.write( "(d)the string ABC & DE
\n" ); document.write( "4!
\n" ); document.write( "----------
\n" ); document.write( "(e)the string CBA & BED
\n" ); document.write( "3!
\n" ); document.write( "===========
\n" ); document.write( "Cheers,
\n" ); document.write( "Stan H.
\n" ); document.write( "
\n" ); document.write( "
\n" );