Answer:
11,880 different ways.
Step-by-step explanation:
We have been given that from a pool of 12 candidates, the offices of president, vice-president, secretary, and treasurer will be filled. We are asked to find the number of ways in which the offices can be filled.
We will use permutations for solve our given problem.
, where,
n = Number of total items,
r = Items being chosen at a time.
For our given scenario 
and 
.
Therefore, offices can be filled in 11,880 different ways.
n=2
8+8(8-n)=40+8n (distribute 8 through the parenthesis)
8+64-8n=40-8n (add the numbers)
<em>72-</em>8n=40+8n (move the variable to the left side and change its sign)
<em>72</em><em>-</em>8n+8n=40
-8n+8n=40<em>-72</em> (connect like terms)
-16n = -32 (divide both sides by -16)
<u><em>n=2</em></u>
The answer is letter d. The Fibonacci Sequence states to add the 2 previous number to get the next number starting with 1. So, 1 + 0=1, 1+1=2, 1+2=3, 2+3=5,3+5=8, 5+8=13, etc....
I added 13+21 to get 34. Then add 21+34 to get 55. Then add 34+55 to get 89.
12 more boys than girls
ratio of boys to girls = 7:5
thus 2/12 is difference between boys and girls = 12
total students = 12 ÷ 2/12 = 72
Answer:
because length is same I hope it will help you please follow me
