Solve for x and then find the measure of
1 answer:
You might be interested in
Answer:
There are 524,560 ways that the committee can be appointed.
Step-by-step explanation:
There are 9 different positions, a president, 3 officers and five committee members.
So
P - O1 - O2 - O3 - C1 - C2 - C3 - C4 - C5
There are 17 candidates, any of them can be president. So P = 17.
All of the others can be an officers. So O1 = 16, O2 = 15(17 subtracted by the president and O1), O3 = 14.
The officers can be committee members, so, C1 = 16, C2 = 15, C3 = 14, C4 = 13, C5 = 12.
How many different ways can the committee be appointed?
This is the sequence C1...C5:
There are 524,560 ways that the committee can be appointed.
Answer:
has the least value because it's further from 0. The biggest negative number is the least because that number is further from 0. The smallest negative number is the biggest because it's closest to 0.
<u>Example:</u>
Find the least value of the following numbers: -6,-2,-1,-4,-10,-3
The least value in this problem is -10 due to the fact it's further from 0. The greatest value is -1 because it's closest to 0.
Least to Greatest Order: -10,-6,-4,-3,-2,-1
Greatest to Least Order: -1,-2,-3,-4,-6,-10