document.write( "Question 501875: In how many ways can ten test questions be arranged so that the easiest and most difficult do not follow one another? I took away 2 from 10 leaving 8 questions to arrange...but i'm stumped... \n" ); document.write( "
Algebra.Com's Answer #339052 by sudhanshu_kmr(1152)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Total number of ways to arrange 10 questions = 10!\r \n" ); document.write( "\n" ); document.write( "number of ways when easiest and most difficult follow each other = 2 * 9! \n" ); document.write( "(assume that pair of easiest and most difficult as single one )\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "so, total number of ways when easiest and most difficult don;t follow each other\r \n" ); document.write( "\n" ); document.write( " = 10! - 2* 9!\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "if any doubt, you are welcome to contact. \n" ); document.write( " \n" ); document.write( " |