document.write( "Question 1105357: Help me please!\r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "A bus starts with 6 people and stops at 10 different stops. How many different ways can the 6 people depart if;
\n" );
document.write( "A. Any passenger can depart at any bus stop.
\n" );
document.write( "B. No two passengers can depart at the same bus stop. \n" );
document.write( "
Algebra.Com's Answer #720168 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "I will solve ONLY the case B here.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "It is the same as to ask:\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( " In how many ways 6 different pigeons can be placed in 10 pigeonholes, under the condition\r\n" ); document.write( " that there are no two pigeons in one pigeonhole ?\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "The answer is: in 10*9*8*7*6*5 = 151200 ways.\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( " 1-st pigeon can be placed into any of 10 pigeonholes;\r\n" ); document.write( " 2-nd pigeon can be placed into any of remained 9 pigeonholes;\r\n" ); document.write( " 3-rd pigeon can be placed into any of remained 8 pigeonholes;\r\n" ); document.write( " 4-th pigeon can be placed into any of remained 7 pigeonholes;\r\n" ); document.write( " 5-th pigeon can be placed into any of remained 6 pigeonholes;\r\n" ); document.write( " 6-th pigeon can be placed into any of remained 5 pigeonholes.\r\n" ); document.write( "\r \n" ); document.write( "\n" ); document.write( "--------------- \n" ); document.write( "On Combinations, see the lessons\r \n" ); document.write( "\n" ); document.write( " - Introduction to Combinations\r \n" ); document.write( "\n" ); document.write( " - PROOF of the formula on the number of Combinations\r \n" ); document.write( "\n" ); document.write( " - Problems on Combinations\r \n" ); document.write( "\n" ); document.write( " - Arranging elements of sets containing indistinguishable elements \r \n" ); document.write( "\n" ); document.write( " - Persons sitting around a circular table \r \n" ); document.write( "\n" ); document.write( " - Combinatoric problems for entities other than permutations and combinations \r \n" ); document.write( "\n" ); document.write( " - OVERVIEW of lessons on Permutations and Combinations\r \n" ); document.write( "\n" ); document.write( "in this site.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Also, you have this free of charge online textbook in ALGEBRA-II in this site\r \n" ); document.write( "\n" ); document.write( " - ALGEBRA-II - YOUR ONLINE TEXTBOOK.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "The referred lessons are the part of this online textbook under the topic \"Combinatorics: Combinations and permutations\". \r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Save the link to this textbook together with its description\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Free of charge online textbook in ALGEBRA-II \n" ); document.write( "https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "into your archive and use when it is needed.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |