SOLUTION: At an annual board meeting company X is deciding whether or not to take the company public. Each board member can vote "yes", "no", or "abstain". If there are n-board members, then

Algebra ->  Functions -> SOLUTION: At an annual board meeting company X is deciding whether or not to take the company public. Each board member can vote "yes", "no", or "abstain". If there are n-board members, then      Log On


   

Question 1176932: At an annual board meeting company X is deciding whether or not to take the company public. Each board member can vote "yes", "no", or "abstain". If there are n-board members, then how many different ways can the votes be cast? Express your answer as a recursive function, f(n). Do not forget to include any necessary base case(s).
Give another function to answer the above question, but this time your function must NOT be recursive. Hint: Think about the counting theory.
Answer by ikleyn(52750) About Me  (Show Source):
You can put this solution on YOUR website!
.

If each board member has  3  options to vote and these voting options are independent,

then there are   3%5En   different ways the votes can be cast.             ANSWER

----------------

Solved.