document.write( "Question 1176882: 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).
\n" ); document.write( " \n" ); document.write( "
Algebra.Com's Answer #850554 by ikleyn(52852)\"\" \"About 
You can put this solution on YOUR website!
.
\n" ); document.write( "At an annual board meeting company X is deciding whether or not to take the company public.
\n" ); document.write( "Each board member can vote “yes”, “no”, or “abstain.” If there are n-board members,
\n" ); document.write( "then how many different ways can the votes be cast? Express your answer as a recursive function, f(n).
\n" ); document.write( "Do not forget to include any necessary base case(s).
\n" ); document.write( "~~~~~~~~~~~~~~~~~~~~~~~\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "It is much easier to get / (to write) the final formula, than the recursive formula.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "For n members in the board, the full set of possible answers has \"3%5En\" elements.
\n" ); document.write( "It is OBVIOUS, since there are 3 possible answers foe each member, and these answers are independent for members.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "So, the request to write a recursive function is unnecessary complication of the problem.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( " \n" ); document.write( "
\n" );