Question 507701
Since order matters, you'll use the permutation formula


P(n,r) = n!/(n-r)!



In this case, n = 12 and r = 3



P(n,r) = n!/(n-r)!


P(12,3) = (12!)/((12-3)!)


P(12,3) = (12!)/(9!)


P(12,3) = (12*11*10*9!)/(9!)


P(12,3) = 12*11*10


P(12,3) = 1320



So there are 1320 different ways to choose 3 separate officeholder positions.


Let me know if you need more help or if you need me to explain a step in more detail.
Feel free to email me at <a href="mailto:jim_thompson5910@hotmail.com?Subject=I%20Need%20Algebra%20Help">jim_thompson5910@hotmail.com</a>
or you can visit my website here: <a href="http://www.freewebs.com/jimthompson5910/home.html">http://www.freewebs.com/jimthompson5910/home.html</a>


Thanks,


Jim