document.write( "Question 1209003: Suppose we want to choose 6 letters, without replacement, from 8 distinct letters.
\n" );
document.write( "
\n" );
document.write( " How many ways can this be done, if the order of the choices does not matter?\r
\n" );
document.write( "\n" );
document.write( "How many ways can this be done, if the order of the choices matters? \n" );
document.write( "
Algebra.Com's Answer #847561 by ikleyn(52781)![]() ![]() You can put this solution on YOUR website! . \n" ); document.write( "Suppose we want to choose 6 letters, without replacement, from 8 distinct letters. \n" ); document.write( "(a) How many ways can this be done, if the order of the choices does not matter? \n" ); document.write( "(b) How many ways can this be done, if the order of the choices matters? \n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \r\n" ); document.write( "(a) If the order does not matter, then the question is about combinations.\r\n" ); document.write( "\r\n" ); document.write( " The number of choices is the number of combinations of 8 distinct letters taken 6 at a time\r\n" ); document.write( "\r\n" ); document.write( "\r\n" ); document.write( "\r \n" ); document.write( "\n" ); document.write( "Solved, with complete explanations.\r \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |