document.write( "Question 1146205: A sheriff is choosing three shift commanders from 10 candidates who have expressed interest in the promotion. In how many ways can he do this? \n" ); document.write( "
Algebra.Com's Answer #768017 by ikleyn(52781)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "
\r\n" );
document.write( "The order in this selection does not matter, so the problem is about COMBINATIONS, not about permutations.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "The answer is  \r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "\"C%5B10%5D%5E3\" = \"%2810%2A9%2A8%29%2F%281%2A2%2A3%29\" = 120.\r\n" );
document.write( "
\r
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "
\n" );