document.write( "Question 1029837: Could someone please help me with this problem? I think I may be on the right track, but am not really sure!
\n" );
document.write( "\"From a squad of 12 cheerleaders, 10 will assemble themselves into a 4-level pyramid.
\n" );
document.write( "a) how many different combinations of cheerleaders can be used to build the pyramid? **I think it's 12/10 or 12 C 10 (sub 12, C, sub 10/don't know how to get it on here correctly, sorry!) which equals 66, but I don't understand how to work it out.
\n" );
document.write( "b) the coach decides that Alexis must be at the top of the pyramid, and that Rachel, Jen, Britt, and Nicole will form the base. How many different combinations of 10 cheerleaders can now be chosen to form the pyramid?
\n" );
document.write( "**I think it's 7/5 and answer is 21, but again I don't know for sure or how to actually arrive at that answer
\n" );
document.write( "c) Suppose alexis has an injury and can't participate. the coach replaces Alexis with Rebecca. Now, how many different combinations of 10 cheerleaders can the coach select?
\n" );
document.write( "*I think it's 6/5 which equals 6, same on this one, not sure how to work out. Or, if my answers are even correct??
\n" );
document.write( "Any help would be appreciated! Thanks! \n" );
document.write( "
Algebra.Com's Answer #644902 by KMST(5328)![]() ![]() You can put this solution on YOUR website! There are originally \n" ); document.write( "Of those \n" ); document.write( "The other \n" ); document.write( "As the problem's wording suggests, it is a question of combinations (where order/position in the pyramid does not matter). \n" ); document.write( "It is not a question of permutations. \n" ); document.write( " \n" ); document.write( "a) The number of different combinations (subsets) of \n" ); document.write( "that can be made from that set of \n" ); document.write( "The written and applied formula may be required by the teacher. \n" ); document.write( "Reasoning is all that is needed to get to the solution and/or the formula. \n" ); document.write( "The formula for the number of combinations (subsets) of \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "In this case, \n" ); document.write( " \n" ); document.write( "You could look at it from the other side. \n" ); document.write( "The number of different possible combinations of \n" ); document.write( "the number of different possible combinations of \n" ); document.write( "Reasoning and calculating the answer that way is easier. \n" ); document.write( "The coach could look at the cheerleaders and decide to leave out the \n" ); document.write( "There would be \n" ); document.write( "and \n" ); document.write( "So the coach's thinking could be made in \n" ); document.write( "But since the same set of \n" ); document.write( "the number of different possible sets of \n" ); document.write( " \n" ); document.write( "Applying the formula, we would calculate it as \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "b) Once the coach decide on the \n" ); document.write( "it is a question of how many different sets of other cheerleaders can the coach choose to form the other two layers to complete the pyramid. \n" ); document.write( "There are still \n" ); document.write( "The number of possible choices is \n" ); document.write( " \n" ); document.write( "You can also reason there are \n" ); document.write( " \n" ); document.write( "c)With Alexis injured, there are only \n" ); document.write( "Other than that, it is like the situation in part b: \n" ); document.write( "after the coach picks \n" ); document.write( "there are \n" ); document.write( "out of the \n" ); document.write( " \n" ); document.write( "You can also reason there are \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "THE REASONING FOR THE FORMULA: \n" ); document.write( "The reasoning is that when you make the list of the \n" ); document.write( "there are \n" ); document.write( " \n" ); document.write( "so the list is being built \n" ); document.write( "The number of ways is a product of consecutive factors counting down from \n" ); document.write( "After the last item is chosen, there are \n" ); document.write( "so the final product does not include \n" ); document.write( "but all the other factors in \n" ); document.write( "The final product is \n" ); document.write( " \n" ); document.write( "However, a list of \n" ); document.write( "because there are \n" ); document.write( "Since the \n" ); document.write( "the number of combinations of \n" ); document.write( " |