Answer:
The members of the cabinet can be appointed in 121,080,960 different ways.
Step-by-step explanation:
The rank is important(matters), which means that the order in which the candidates are chosen is important. That is, if we exchange the position of two candidates, it is a new outcome. So we use the permutations formula to solve this quesiton.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
If there are 14 eligible candidates for these positions (where rank matters), how many different ways can the members of the cabinet be appointed?
Permutations of 8 from a set of 14. So
The members of the cabinet can be appointed in 121,080,960 different ways.
Answer:
1) Arithmetic since it decreases by 3 so, -3n + 38.
2) Arithmetic since it decreases by 20 each time, so -20n+17
Step-by-step explanation:
Answer:
All Real Numbers
Step-by-step explanation:
Step 1:
3x - 9 = 3 ( x - 3 ) Equation
Step 2:
3x - 9 = 3x - 9 Multiply
Step 3:
- 9 = - 9 Subtract 3x on both sides
Answer:
All Real Numbers
Hope This Helps :)
Answer:
Step-by-step explanation:
if solving for y
solve for y by simplifying both sides of equation, then isolating the variable.
y=-3w+10+W
if solving for W
W=3w-10+y
if solving for w
w=W/3 - y/3 + 10/3
Answer:
The answer is 10.6 (I'm sorry if it's wrong)
Step-by-step explanation:
found out what D and B is (they both are 4 I think) then add 10 with 8 then divide 120 with 18 which is 6.6 then add what D is and then I got 10.6
