document.write( "Question 1192079: A math club has 30 members. During their acquaintance gathering, they have to choose 3 officers: president, vice - president, and secretary. If each office is to be held by 1 person and no person can hold more than one office, how many ways can these offices be filled? \n" ); document.write( "
Algebra.Com's Answer #823976 by math_tutor2020(3817)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Start at 30 and count down by 1 until three slots are filled.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "30 choices for president \n" ); document.write( "29 choices for VP \n" ); document.write( "28 choices for secretary\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Then multiply out those items. \n" ); document.write( "There are 30*29*28 = 24,360 different ways to fill these three positions. Order matters.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Order matters because ABC is different from BAC as shown below
\n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Since order matters, you can use the nPr permutation formula with n = 30 and r = 3. This is an alternative pathway but the steps mentioned above are an easier route. \n" ); document.write( " \n" ); document.write( " |