Y= the number riders over time
x= hours into Tara's shift
y= 33x + 132
Answer:
maybe 5250
Step-by-step explanation:
i think
Check the picture below.
now, we have a triangle with all three sides, thus we can use Heron's Area Formula on the triangle.
![\bf \qquad \textit{Heron's area formula} \\\\ A=\sqrt{s(s-a)(s-b)(s-c)}\qquad \begin{cases} s=\frac{a+b+c}{2}\\[-0.5em] \hrulefill\\ a=10\\ b=26.695\\ c=22\\ s=29.3475 \end{cases} \\\\\\ A=\sqrt{29.3475(29.3475-10)(29.3475-26.695)(29.3475-22)} \\\\\\ A=\sqrt{29.3475(19.3475)(2.6525)(7.3475)}\implies A\approx \sqrt{11066.007} \\\\[-0.35em] \rule{34em}{0.25pt}\\\\ ~\hfill A\approx 105.195~\hfill](https://tex.z-dn.net/?f=%5Cbf%20%5Cqquad%20%5Ctextit%7BHeron%27s%20area%20formula%7D%20%5C%5C%5C%5C%20A%3D%5Csqrt%7Bs%28s-a%29%28s-b%29%28s-c%29%7D%5Cqquad%20%5Cbegin%7Bcases%7D%20s%3D%5Cfrac%7Ba%2Bb%2Bc%7D%7B2%7D%5C%5C%5B-0.5em%5D%20%5Chrulefill%5C%5C%20a%3D10%5C%5C%20b%3D26.695%5C%5C%20c%3D22%5C%5C%20s%3D29.3475%20%5Cend%7Bcases%7D%20%5C%5C%5C%5C%5C%5C%20A%3D%5Csqrt%7B29.3475%2829.3475-10%29%2829.3475-26.695%29%2829.3475-22%29%7D%20%5C%5C%5C%5C%5C%5C%20A%3D%5Csqrt%7B29.3475%2819.3475%29%282.6525%29%287.3475%29%7D%5Cimplies%20A%5Capprox%20%5Csqrt%7B11066.007%7D%20%5C%5C%5C%5C%5B-0.35em%5D%20%5Crule%7B34em%7D%7B0.25pt%7D%5C%5C%5C%5C%20~%5Chfill%20A%5Capprox%20105.195~%5Chfill)
I believe the answer is 16/9
Let's call the stamps A, B, and C. They can each be used only once. I assume all 3 must be used in each possible arrangement.
There are two ways to solve this. We can list each possible arrangement of stamps, or we can plug in the numbers to a formula.
Let's find all possible arrangements first. We can easily start spouting out possible arrangements of the 3 stamps, but to make sure we find them all, let's go in alphabetical order. First, let's look at the arrangements that start with A:
ABC
ACB
There are no other ways to arrange 3 stamps with the first stamp being A. Let's look at the ways to arrange them starting with B:
BAC
BCA
Try finding the arrangements that start with C:
C_ _
C_ _
Or we can try a little formula; y×(y-1)×(y-2)×(y-3)...until the (y-x) = 1 where y=the number of items.
In this case there are 3 stamps, so y=3, and the formula looks like this: 3×(3-1)×(3-2).
Confused? Let me explain why it works.
There are 3 possibilities for the first stamp: A, B, or C.
There are 2 possibilities for the second space: The two stamps that are not in the first space.
There is 1 possibility for the third space: the stamp not used in the first or second space.
So the number of possibilities, in this case, is 3×2×1.
We can see that the number of ways that 3 stamps can be attached is the same regardless of method used.
