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.
Step-by-step explanation:
coefficient of x is 17
coefficient of y is -5
coefficient of constant term: 3 + 19 + 10 = 32
Answer:
1073.38
Step-by-step explanation:
975 × 0.01 = 9.75
9.75 + 975 = 984.75
984.75 × 0.09 = 88.6275
88.6275 + 984.75 = <u>1073.38</u>
I think The answer is 5100