document.write( "Question 1104140: In how many ways can the new president choose a secretary of defense, offense , and a secretary on the fence from a pool of 12 candidates? \n" ); document.write( "

Algebra.Com's Answer #718875 by josmiceli(19441) $\"\"$ $\"About$

You can put this solution on YOUR website!
The order does matter in this problem
\n" ); document.write( "Suppose a, b, and c are 3 of the 12
\n" ); document.write( "candidates
\n" ); document.write( "-------------
\n" ); document.write( "defence: a
\n" ); document.write( "offence: b
\n" ); document.write( "fence: c
\n" ); document.write( "is different from
\n" ); document.write( "def: b
\n" ); document.write( "off: c
\n" ); document.write( "fen: a
\n" ); document.write( "------------------
\n" ); document.write( "12P3 = $\"+12%21%2F%28+12+-+3+%29%21+\"$
\n" ); document.write( "12P3 = $\"+12%21+%2F+9%21+\"$
\n" ); document.write( "12P3 = $\"+12%2A11%2A10+\"$
\n" ); document.write( "12P3 = $\"+1320+\"$
\n" ); document.write( "1,320 different ways\r
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "

\n" );