Answer:2.5 I just took the test
Step-by-step explanation:
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:
c = 5
Step-by-step explanation:
- 6 + 2c = 3c -(6+5)
-6 + 2c = 3c -11
-6 + 11 = 3c- 2c
5 = c
Answer:
C
Step-by-step explanation:
:)
3^3+9=77 if I'm wrong I'm sorry I just guess