document.write( "Question 1183064: how many strings can be formed by ordering the letters ABCDE if: (1pt each)
\n" ); document.write( "a.) A appears before D;
\n" ); document.write( "b.) Contains either the substring DB or the substring BE or both
\n" ); document.write( " \n" ); document.write( "

Algebra.Com's Answer #813221 by ikleyn(52781) $\"\"$ $\"About$

You can put this solution on YOUR website!
.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " In my response, I will answer part (a), ONLY, because it is really good entertainment problem/question, \r
\n" ); document.write( "\n" ); document.write( " while the part (b) is rather technical - so, the two parts differ by their style.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "

\r\n" );
document.write( "The answer is   =  =  = 60 strings,\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "because exactly half of all 120 permutations have A appeared before D, \r\n" );
document.write( "while the other half of the 120 permutations have A appeared after D.\r\n" );
document.write( "

\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Part (a) is answered.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );