Answer:
720 MPH
Step-by-step explanation:
2700 miles / 3.75 hours = 720 MPH
we know that
the volume of a solid oblique pyramid is equal to

where
B is the area of the base
h is the height of the pyramid
in this problem we have that
B is a square

where
<u>
</u>
so


substitute in the formula of volume
![V=\frac{1}{3}*x^{2}*(x+2)\\ \\V=\frac{1}{3}*[x^{3} +2x^{2}]\ cm^{3}](https://tex.z-dn.net/?f=V%3D%5Cfrac%7B1%7D%7B3%7D%2Ax%5E%7B2%7D%2A%28x%2B2%29%5C%5C%20%5C%5CV%3D%5Cfrac%7B1%7D%7B3%7D%2A%5Bx%5E%7B3%7D%20%2B2x%5E%7B2%7D%5D%5C%20cm%5E%7B3%7D)
therefore
<u>the answer is</u>
![V=\frac{1}{3}*[x^{3} +2x^{2}]\ cm^{3}](https://tex.z-dn.net/?f=V%3D%5Cfrac%7B1%7D%7B3%7D%2A%5Bx%5E%7B3%7D%20%2B2x%5E%7B2%7D%5D%5C%20cm%5E%7B3%7D)
Answer:
.
Step-by-step explanation:
Since repetition isn't allowed, there would be
choices for the first donut,
choices for the second donut, and
choices for the third donut. If the order in which donuts are placed in the bag matters, there would be
unique ways to choose a bag of these donuts.
In practice, donuts in the bag are mixed, and the ordering of donuts doesn't matter. The same way of counting would then count every possible mix of three donuts type
times.
For example, if a bag includes donut of type
,
, and
, the count
would include the following
arrangements:
Thus, when the order of donuts in the bag doesn't matter, it would be necessary to divide the count
by
to find the actual number of donut combinations:
.
Using combinatorics notations, the answer to this question is the same as the number of ways to choose an unordered set of
objects from a set of
distinct objects:
.
Answer:
Can you post 4.3? We need more information to answer this.
Step-by-step explanation:
I Got 0.01041666666 As An Answer <span />