Answer:
#5 -1.75, 2.5, -0.2
#6 3 1/2, 2 1/4, -1/2
Step-by-step explanation:
Well when the opposite they mean if the number is positive it becomes negative, and if is negative it becomes positive. very simple happy to help :)
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:
B is the correct answer, i know yhos i fif iy on edge
You can use the ASA postulate which means angle side angle. if 2 angles and the including side are congruent to the corresponding parts of another triangle then the triangles are congruent. hope that helps :)