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:
Range is : { -10, -7, -5, -2 }
Step-by-step explanation:
Given:
The function is given as:
The domain of the function = { -3, 0, 2, 5 }
A function's input is called its domain and a function's output is called its range.
The range depends on the domain values. So, the values of 'y' are the values of range and the values of 'x' are the values of domain.
Here, the domain is given as:
Domain = { -3, 0, 2, 5 }
We need to find the values of 'y' for each value of 'x' taken from the domain set.
Plug in . This gives,
Plug in . This gives,
Plug in . This gives,
Plug in . This gives,
Therefore, the set of all values of 'y' is the range.
Range is equal to { -10, -7, -5, -2 }.
$305.25 divided by $9.25 equals 33, so he worked 33 hours... hope this helped.