This type of essay answer is pretty short.
You play out the equation and say what each part of the equation means. The vertex in this case, because it's a downward facing parabola, is the highest point on the graph. Now since they're kicking a ball, the vertex will be the highest point that the ball will go up to.
Hopefully this helps some. For full points you'll probably have to add a bit of padding and further explanation.
17 x -6 = -102
17 + -6 = 11
The answer is 17 and -6
I would say 169 but I’m not positive
Answer:
204 in
Step-by-step explanation:
6 3/8 * 3 * 10 2/3
204
Answer:
![C^{102}_{100}=5151](https://tex.z-dn.net/?f=C%5E%7B102%7D_%7B100%7D%3D5151)
Step-by-step explanation:
Let's imagine the following situation, if we want to distribute 100 coins between three pirates we could represent this situation with a line arrangement. For example if we had7 coins and 3 pirates one possible distribution of coins would be given by CC|CCCC|C, the C's represent coins and the bars the boundaries between two pirates, for the particular line arrangement shown, we have that pirate A has 2 coins, B has 4 coins and C has a single coin. Another possible arrangement is,
|CCC|CCCC, where pirate A has no coin, pirate B has 3 coins and C has 7 coins. If we take notice of the fact that the arrangement representing a distribution is composed of 9 elements, that is 7 C's and 2 | (bars), then a way to make an arrangement would be to fill 9 empty boxes with our available coins and bars in all the possible ways. This means that if we first choose to fill 7 out of 9 boxes with coins then the number of possible combinations is
. In general if we want to distribute n elements in k boxes, where the boxes can either be filled with any number of elements (including 0 number of elements), we have that the number of possible distributions will be
possible divisions.
Bonus:
If every pirate wants to have the maximum number of coins possible without being executed, here's how pirate A has to divide the coins in order to keep the largest amount of coins.
We have to think backwards to figure this out. Imagine pirate A was executed and there are only two remaining players. Pirate B should propose to keep all the coins, pirate C could oppose but pirate B's vote would break the vote and keep all the loot. Pirate A, B and C are all aware of this, so pirate A should propose to keep 99 coins and give the remaining gold piece to pirate C, Pirate B will of course oppose the division, but pirate C should accept because if not he would get no coins. Thus the division would be.
A: 99 coins
B: 0 coins
C: 1 coins