9514 1404 393
Answer:
524,160
Step-by-step explanation:
Assuming order matters, it is the number of permutations of 16 things taken 5 at a time:
16P5 = 16!/(16-5)! = 16·15·14·13·12 = 524,160
_____
The first passenger can pick any of 16 seats; the second can pick any of 15 remaining seats; and so on until all 5 passengers have chosen a seat. The number of possible different arrangements is the number shown above.
When you GRAPH an equation or inequality you plot all of the points that satisfy it.
Answer:
The anchor should be located at the midpoint between the 20m high and 60m high antennas.
Step-by-step explanation:
Let the length of cable for 20m high antenna be represented by x, and that for 60m high antenna be y.
The single length of cable required = x + y.
From the principle of geometry, if the cable is anchored at 200m from the 20m high antenna, it forms a right angled triangle. Applying the Pythagoras theorem,
x = ![\sqrt{200^{2} - 20^{2} }](https://tex.z-dn.net/?f=%5Csqrt%7B200%5E%7B2%7D%20-%2020%5E%7B2%7D%20%7D)
= 199
Applying the same principle to the 60m high antenna gives,
y = ![\sqrt{200^{2} - 60^{2} }](https://tex.z-dn.net/?f=%5Csqrt%7B200%5E%7B2%7D%20-%2060%5E%7B2%7D%20%7D)
= 191
The single length of cable required = 199+ 191
= 390m
Varying the point of location of the anchor between the two antennas causes an increase in the length of cable required.
The anchor should be located at the midpoint between the two antennas to achieve a minimum amount of cable.
Answer:
4.) -3x² - 5x + 7
- 3 * -2 * -3 * -2
+6 * +6 - 5 * -2
36 - (+10)
36 - 10 = 26
5.) 3x² - 7y²
3 * x X 3 * x - 7 * y X 7 * y
3 * 2 X 3 * 2 - 7 * 3 X 7 * 3
6 * 6 - 21 * 21
36 - 441 = -405
6.) 4(x - 2y)
________
x + y
4 * x - 4 * 2 X y
_____________
x + y
4 * 4 - 4 * 2 X -2
16 - (+16)
16 - 16 = 0
7. π + x√3y
22/7 + -3√15
3094
_____
22/7 + -11
5000
2380
= -8 ______
5000
Step-by-step explanation:
Please mark me as brainliest
You would have a equal amount of both dimes and nickels. Therefore 6 dimes and 6 nickels is the answer.
please vote my answer brainliest. thanks!