document.write( "Question 1099905: There are 10 students from whom 4 are going to be chosen to represent their club at a meeting. If, Sue, Mark, or John, but only one of them must be chosen, in how many ways can the students be chosen to go to the meeting?
\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #714418 by Edwin McCravy(20055)![]() ![]() You can put this solution on YOUR website! \r\n" ); document.write( "Notice that the problem is different if you change \"MUST\" to \"CAN\":\r\n" ); document.write( " \n" ); document.write( "There are 10 students from whom 4 are going to be chosen to \n" ); document.write( "represent their club at a meeting. If, Sue, Mark, or John, \n" ); document.write( "but only one of them MUST be chosen, in how many ways can \n" ); document.write( "the students be chosen to go to the meeting? \n" ); document.write( " \r\n" ); document.write( "That's (3 choose 1) AND (7 choose 3)\r\n" ); document.write( "\r\n" ); document.write( "(3C1)(7C3) = (3)(35) = 105 ways.\r\n" ); document.write( "\r\n" ); document.write( "However if the problem were:\r\n" ); document.write( "\r\n" ); document.write( " \n" ); document.write( "There are 10 students from whom 4 are going to be chosen to \n" ); document.write( "represent their club at a meeting. If, Sue, Mark, or John, \n" ); document.write( "but only one of them CAN be chosen, in how many ways can \n" ); document.write( "the students be chosen to go to the meeting? \n" ); document.write( " \r\n" ); document.write( "That's [(3 choose 1) AND (7 choose 3)] OR [(3 choose 0) AND (7 choose 4)]\r\n" ); document.write( "\r\n" ); document.write( "(3C1)(7C3) + (3C0)(7C4) = (3)(35) + (1)(35) = 105 + 35 = 140 ways.\r\n" ); document.write( "\r\n" ); document.write( "Edwin\n" ); document.write( " |