document.write( "Question 90525: there are 4 positions with 6 people to fill. How many different ways can the officers be elected? \n" ); document.write( "
Algebra.Com's Answer #65691 by jim_thompson5910(35256)![]() ![]() ![]() You can put this solution on YOUR website! \r \n" ); document.write( "\n" ); document.write( "Since order does matter, we can use the permutation formula:\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( "Expand 6! \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Expand 2! \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 6 choose 4 (where order does matter) yields 360 unique combinations\r \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |