document.write( "Question 1103709: The number of arrangements that can be formed by taking all the letters of the word CHEESE so that no two Es come together \n" ); document.write( "
Algebra.Com's Answer #718406 by Edwin McCravy(20055)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "There are only 4 basic ways that no two Es come together.\r\n" );
document.write( "They are\r\n" );
document.write( "\r\n" );
document.write( "1.   _ E _ E _ E\r\n" );
document.write( "\r\n" );
document.write( "2.   E _ _ E _ E\r\n" );
document.write( "\r\n" );
document.write( "3.   E _ E _ _ E\r\n" );
document.write( "\r\n" );
document.write( "4.   E _ E _ E _\r\n" );
document.write( "\r\n" );
document.write( "where the letters C, H and S fill the blanks.\r\n" );
document.write( "\r\n" );
document.write( "For each of those 4 ways we can arrange the C, H and S\r\n" );
document.write( "in the 3 blanks in 3! ways.\r\n" );
document.write( "\r\n" );
document.write( "Answer (4)(3!) = (4)(6) = 24 ways.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );