Negative. It’s the only one that makes since. ( probably)
By definition of complement,
Pr[not P | G and T] = 1 - Pr[P | G and T]
and by definition of conditional probability,
Pr[not P | G and T] = 1 - Pr[P and G and T] / Pr[G and T]
Pr[not P | G and T] = 1 - (16/100) / (33/100)
Pr[not P | G and T] = 1 - 16/33
Pr[not P | G and T] = 17/33
Step-by-step explanation:
<em><u>I </u></em><em><u>thin</u></em><em><u>k</u></em><em><u> </u></em><em><u>mode</u></em><em><u>,</u></em><em><u>range</u></em><em><u> </u></em><em><u>and</u></em><em><u> </u></em><em><u>median</u></em><em><u> </u></em><em><u>dpo</u></em><em><u> </u></em><em><u>ako</u></em><em><u> </u></em><em><u>sure</u></em>
1.50y(2)+2.00x=20
Now use the quadratic formula to solve
The first step is to determine the distance between the points, (1,1) and (7,9)
We would find this distance by applying the formula shown below
![\begin{gathered} \text{Distance = }\sqrt[]{(x2-x1)^2+(y2-y1)^2} \\ \text{From the graph, } \\ x1\text{ = 1, y1 = 1} \\ x2\text{ = 7, y2 = 9} \\ \text{Distance = }\sqrt[]{(7-1)^2+(9-1)^2} \\ \text{Distance = }\sqrt[]{6^2+8^2}\text{ = }\sqrt[]{100} \\ \text{Distance = 10} \end{gathered}](https://tex.z-dn.net/?f=%5Cbegin%7Bgathered%7D%20%5Ctext%7BDistance%20%3D%20%7D%5Csqrt%5B%5D%7B%28x2-x1%29%5E2%2B%28y2-y1%29%5E2%7D%20%5C%5C%20%5Ctext%7BFrom%20the%20graph%2C%20%7D%20%5C%5C%20x1%5Ctext%7B%20%3D%201%2C%20y1%20%3D%201%7D%20%5C%5C%20x2%5Ctext%7B%20%3D%207%2C%20y2%20%3D%209%7D%20%5C%5C%20%5Ctext%7BDistance%20%3D%20%7D%5Csqrt%5B%5D%7B%287-1%29%5E2%2B%289-1%29%5E2%7D%20%5C%5C%20%5Ctext%7BDistance%20%3D%20%7D%5Csqrt%5B%5D%7B6%5E2%2B8%5E2%7D%5Ctext%7B%20%3D%20%7D%5Csqrt%5B%5D%7B100%7D%20%5C%5C%20%5Ctext%7BDistance%20%3D%2010%7D%20%5Cend%7Bgathered%7D)
Distance = 10 units
If one unit is 70 meters, then the distance between both entrances is
70 * 10 = 700 meters