document.write( "Question 199877: This is the last problem that i missed on my exam please help me .. so I will have it straigh for my final. thank you T-Aun\r
\n" );
document.write( "
\n" );
document.write( "
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( "How many different ways are there for an admissions officer to select a group of 6 college candidates from a group of 15 applicants for an interview? \r
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "
Algebra.Com's Answer #150245 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! Unfortunately, the previous solution is incorrect. Why? They're not looking for a probability, they just want to know the number of possible combinations.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "We could use the counting principle to solve this problem, but we'll have overlap and the sample space is far too large. So let's do it this way:\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "In this case, order does NOT matter since the candidates have no rank over one another (ie one isn't president or secretary). \r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Since order does not matter, we must use the <a rel=nofollow HREF=http://www.mathwords.com/c/combination_formula.htm>combination formula</a>:\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "So 15 choose 6 (where order doesn't matter) yields 5,005 unique combinations\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "This means that there are 5,005 different ways to select a group of 6 college candidates from a group of 15 applicants for an interview (where the order of the candidates doesn't matter).\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |