document.write( "Question 265871: Question: I have 12 textbooks to arrange on a bookshelf. 5 of them are English textbooks and I would like to arrange the books so that at least two of the English textbooks are adjacent to one another. How many different arrangements are possible?\r
\n" );
document.write( "\n" );
document.write( "This is how far I have gotten:
\n" );
document.write( "(# of ways that all are touching) - (# of ways that none are touching)
\n" );
document.write( "(5!)(7!)(2!) - ????\r
\n" );
document.write( "\n" );
document.write( "If I am on the right track... how do I figure out the (# of ways that none are touching)?\r
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #195454 by stanbon(75887)![]() ![]() ![]() You can put this solution on YOUR website! Question: I have 12 textbooks to arrange on a bookshelf. 5 of them are English textbooks and I would like to arrange the books so that at least two of the English textbooks are adjacent to one another. How many different arrangements are possible? \n" ); document.write( "--- \n" ); document.write( "Answer: total # of arrangements - # of arrangements with no two english adjacent \n" ); document.write( "--- \n" ); document.write( "# no 2 are adjacent = ? \n" ); document.write( "---- \n" ); document.write( "Four non-englsh will be required to separate the 5 english. \n" ); document.write( "# of ways to select the 4 separaters: 7C4 = 35 \n" ); document.write( "Arrangements of the 5 english: 5! \n" ); document.write( "Arrangements of the 4 separaters: 4! \n" ); document.write( "--- \n" ); document.write( "That leaves 3 books to arrange in 3! ways \n" ); document.write( "Total arrangements: 5!*35*4!*3* = 604,800 \n" ); document.write( "----- \n" ); document.write( "So, # no 2 are adjacent = 604800 \n" ); document.write( "=========== \n" ); document.write( "Finally, # at least 2 are adjacent)= 12! - 604800 = 478,396,800 \n" ); document.write( "=========================== \n" ); document.write( "Note: Interesting problem. Let me know when you can \n" ); document.write( "confirm an answer. \n" ); document.write( "=========================== \n" ); document.write( "Cheers, \n" ); document.write( "Stan H.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "This is how far I have gotten: \n" ); document.write( "(# of ways that all are touching) - (# of ways that none are touching) \n" ); document.write( "(5!)(7!)(2!) - ???? \n" ); document.write( "If I am on the right track... how do I figure out the (# of ways that none are touching)? \n" ); document.write( " |